./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4f493a0ec5685991b86ced08697f863f174636a1 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 10:41:48,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 10:41:48,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 10:41:48,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 10:41:48,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 10:41:48,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 10:41:48,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 10:41:48,052 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 10:41:48,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 10:41:48,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 10:41:48,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 10:41:48,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 10:41:48,064 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 10:41:48,066 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 10:41:48,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 10:41:48,071 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 10:41:48,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 10:41:48,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 10:41:48,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 10:41:48,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 10:41:48,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 10:41:48,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 10:41:48,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 10:41:48,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 10:41:48,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 10:41:48,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 10:41:48,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 10:41:48,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 10:41:48,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 10:41:48,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 10:41:48,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 10:41:48,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 10:41:48,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 10:41:48,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 10:41:48,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 10:41:48,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 10:41:48,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 10:41:48,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 10:41:48,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 10:41:48,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 10:41:48,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 10:41:48,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2021-08-27 10:41:48,158 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 10:41:48,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 10:41:48,159 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 10:41:48,159 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 10:41:48,161 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 10:41:48,161 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 10:41:48,161 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 10:41:48,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 10:41:48,162 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 10:41:48,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 10:41:48,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 10:41:48,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-27 10:41:48,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-27 10:41:48,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-27 10:41:48,164 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2021-08-27 10:41:48,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 10:41:48,164 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 10:41:48,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-27 10:41:48,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 10:41:48,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 10:41:48,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-27 10:41:48,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 10:41:48,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 10:41:48,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-27 10:41:48,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-27 10:41:48,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 10:41:48,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-27 10:41:48,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-27 10:41:48,167 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 10:41:48,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f493a0ec5685991b86ced08697f863f174636a1 [2021-08-27 10:41:48,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 10:41:48,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 10:41:48,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 10:41:48,506 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 10:41:48,506 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 10:41:48,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2021-08-27 10:41:48,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d924b4ac/1978a4b4b2df4e65b7f79572b852e2e2/FLAG3b8887d26 [2021-08-27 10:41:48,959 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 10:41:48,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/Toulouse-MultiBranchesToLoop-1.c [2021-08-27 10:41:48,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d924b4ac/1978a4b4b2df4e65b7f79572b852e2e2/FLAG3b8887d26 [2021-08-27 10:41:49,390 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d924b4ac/1978a4b4b2df4e65b7f79572b852e2e2 [2021-08-27 10:41:49,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 10:41:49,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 10:41:49,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 10:41:49,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 10:41:49,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 10:41:49,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29b65263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49, skipping insertion in model container [2021-08-27 10:41:49,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 10:41:49,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 10:41:49,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 10:41:49,538 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 10:41:49,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 10:41:49,574 INFO L208 MainTranslator]: Completed translation [2021-08-27 10:41:49,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49 WrapperNode [2021-08-27 10:41:49,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 10:41:49,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 10:41:49,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 10:41:49,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 10:41:49,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 10:41:49,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 10:41:49,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 10:41:49,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 10:41:49,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,657 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 10:41:49,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 10:41:49,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 10:41:49,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 10:41:49,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49" (1/1) ... [2021-08-27 10:41:49,691 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-27 10:41:49,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 10:41:49,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-27 10:41:49,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-27 10:41:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 10:41:49,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 10:41:50,167 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 10:41:50,168 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-08-27 10:41:50,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:41:50 BoogieIcfgContainer [2021-08-27 10:41:50,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 10:41:50,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-27 10:41:50,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-27 10:41:50,174 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-27 10:41:50,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:41:49" (1/3) ... [2021-08-27 10:41:50,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f662fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:41:50, skipping insertion in model container [2021-08-27 10:41:50,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:41:49" (2/3) ... [2021-08-27 10:41:50,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f662fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:41:50, skipping insertion in model container [2021-08-27 10:41:50,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:41:50" (3/3) ... [2021-08-27 10:41:50,176 INFO L111 eAbstractionObserver]: Analyzing ICFG Toulouse-MultiBranchesToLoop-1.c [2021-08-27 10:41:50,180 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-27 10:41:50,180 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2021-08-27 10:41:50,218 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-27 10:41:50,224 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-27 10:41:50,224 INFO L340 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2021-08-27 10:41:50,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 50 states have (on average 1.94) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:50,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-08-27 10:41:50,241 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:50,242 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-08-27 10:41:50,242 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:50,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:50,247 INFO L82 PathProgramCache]: Analyzing trace with hash 957669, now seen corresponding path program 1 times [2021-08-27 10:41:50,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:50,255 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070768290] [2021-08-27 10:41:50,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:50,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:50,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:50,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070768290] [2021-08-27 10:41:50,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070768290] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:50,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:50,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 10:41:50,394 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873132999] [2021-08-27 10:41:50,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 10:41:50,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:50,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 10:41:50,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:50,414 INFO L87 Difference]: Start difference. First operand has 87 states, 50 states have (on average 1.94) internal successors, (97), 86 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:50,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:50,757 INFO L93 Difference]: Finished difference Result 181 states and 215 transitions. [2021-08-27 10:41:50,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 10:41:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-08-27 10:41:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:50,767 INFO L225 Difference]: With dead ends: 181 [2021-08-27 10:41:50,767 INFO L226 Difference]: Without dead ends: 92 [2021-08-27 10:41:50,770 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2021-08-27 10:41:50,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2021-08-27 10:41:50,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.6727272727272726) internal successors, (92), 82 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:50,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2021-08-27 10:41:50,810 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 4 [2021-08-27 10:41:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:50,810 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2021-08-27 10:41:50,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2021-08-27 10:41:50,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-08-27 10:41:50,812 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:50,812 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-08-27 10:41:50,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-27 10:41:50,813 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:50,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:50,816 INFO L82 PathProgramCache]: Analyzing trace with hash 957477, now seen corresponding path program 1 times [2021-08-27 10:41:50,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:50,817 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350666061] [2021-08-27 10:41:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:50,817 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:50,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:50,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:50,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350666061] [2021-08-27 10:41:50,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350666061] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:50,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:50,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 10:41:50,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439063816] [2021-08-27 10:41:50,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 10:41:50,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:50,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 10:41:50,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:50,842 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:51,081 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-08-27 10:41:51,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 10:41:51,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-08-27 10:41:51,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:51,083 INFO L225 Difference]: With dead ends: 113 [2021-08-27 10:41:51,083 INFO L226 Difference]: Without dead ends: 97 [2021-08-27 10:41:51,083 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:51,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-08-27 10:41:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2021-08-27 10:41:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2021-08-27 10:41:51,089 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 4 [2021-08-27 10:41:51,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:51,090 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2021-08-27 10:41:51,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2021-08-27 10:41:51,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-08-27 10:41:51,090 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:51,091 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-08-27 10:41:51,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-27 10:41:51,091 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:51,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:51,092 INFO L82 PathProgramCache]: Analyzing trace with hash 29747371, now seen corresponding path program 1 times [2021-08-27 10:41:51,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:51,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922616857] [2021-08-27 10:41:51,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:51,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:51,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:51,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922616857] [2021-08-27 10:41:51,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922616857] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:51,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:51,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-27 10:41:51,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012844667] [2021-08-27 10:41:51,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-27 10:41:51,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:51,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 10:41:51,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:51,118 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:51,291 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-08-27 10:41:51,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 10:41:51,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-08-27 10:41:51,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:51,293 INFO L225 Difference]: With dead ends: 90 [2021-08-27 10:41:51,293 INFO L226 Difference]: Without dead ends: 89 [2021-08-27 10:41:51,294 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 10:41:51,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-27 10:41:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2021-08-27 10:41:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 62 states have (on average 1.435483870967742) internal successors, (89), 79 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2021-08-27 10:41:51,298 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2021-08-27 10:41:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:51,298 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2021-08-27 10:41:51,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2021-08-27 10:41:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-27 10:41:51,299 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:51,299 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:51,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-27 10:41:51,300 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:51,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:51,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1540529751, now seen corresponding path program 1 times [2021-08-27 10:41:51,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:51,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773427365] [2021-08-27 10:41:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:51,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:51,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:51,361 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773427365] [2021-08-27 10:41:51,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773427365] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:51,362 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:51,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 10:41:51,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716234109] [2021-08-27 10:41:51,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 10:41:51,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 10:41:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:51,366 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:51,635 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2021-08-27 10:41:51,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 10:41:51,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-08-27 10:41:51,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:51,637 INFO L225 Difference]: With dead ends: 129 [2021-08-27 10:41:51,637 INFO L226 Difference]: Without dead ends: 122 [2021-08-27 10:41:51,637 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-08-27 10:41:51,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 96. [2021-08-27 10:41:51,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2021-08-27 10:41:51,643 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 7 [2021-08-27 10:41:51,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:51,644 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2021-08-27 10:41:51,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,644 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2021-08-27 10:41:51,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-27 10:41:51,645 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:51,645 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:51,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-27 10:41:51,645 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:51,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1440726131, now seen corresponding path program 1 times [2021-08-27 10:41:51,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:51,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227452086] [2021-08-27 10:41:51,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:51,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:51,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:51,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227452086] [2021-08-27 10:41:51,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227452086] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:51,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:51,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 10:41:51,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192989788] [2021-08-27 10:41:51,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-27 10:41:51,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:51,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 10:41:51,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:51,676 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:51,800 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-08-27 10:41:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 10:41:51,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-08-27 10:41:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:51,802 INFO L225 Difference]: With dead ends: 105 [2021-08-27 10:41:51,802 INFO L226 Difference]: Without dead ends: 104 [2021-08-27 10:41:51,802 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-27 10:41:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-08-27 10:41:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2021-08-27 10:41:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 94 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2021-08-27 10:41:51,807 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 8 [2021-08-27 10:41:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:51,808 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-08-27 10:41:51,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2021-08-27 10:41:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-27 10:41:51,809 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:51,809 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:51,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-27 10:41:51,809 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:51,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:51,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2098770931, now seen corresponding path program 1 times [2021-08-27 10:41:51,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:51,810 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474072615] [2021-08-27 10:41:51,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:51,811 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:51,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:51,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:51,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474072615] [2021-08-27 10:41:51,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474072615] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:51,851 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:51,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 10:41:51,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244241249] [2021-08-27 10:41:51,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 10:41:51,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:51,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 10:41:51,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 10:41:51,853 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:52,061 INFO L93 Difference]: Finished difference Result 150 states and 159 transitions. [2021-08-27 10:41:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 10:41:52,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-27 10:41:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:52,063 INFO L225 Difference]: With dead ends: 150 [2021-08-27 10:41:52,063 INFO L226 Difference]: Without dead ends: 144 [2021-08-27 10:41:52,064 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 10:41:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-08-27 10:41:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 105. [2021-08-27 10:41:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.2666666666666666) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2021-08-27 10:41:52,069 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 10 [2021-08-27 10:41:52,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:52,070 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2021-08-27 10:41:52,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2021-08-27 10:41:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-27 10:41:52,071 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:52,071 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:52,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-27 10:41:52,071 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:52,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:52,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1064053241, now seen corresponding path program 1 times [2021-08-27 10:41:52,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:52,073 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913734425] [2021-08-27 10:41:52,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:52,073 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:52,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:52,107 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913734425] [2021-08-27 10:41:52,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913734425] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:52,107 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:52,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 10:41:52,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251996378] [2021-08-27 10:41:52,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 10:41:52,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:52,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 10:41:52,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 10:41:52,109 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:52,224 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2021-08-27 10:41:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 10:41:52,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-27 10:41:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:52,225 INFO L225 Difference]: With dead ends: 114 [2021-08-27 10:41:52,225 INFO L226 Difference]: Without dead ends: 113 [2021-08-27 10:41:52,226 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 10:41:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-27 10:41:52,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2021-08-27 10:41:52,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 103 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2021-08-27 10:41:52,239 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 11 [2021-08-27 10:41:52,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:52,239 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2021-08-27 10:41:52,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2021-08-27 10:41:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-27 10:41:52,240 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:52,240 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:52,240 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-27 10:41:52,240 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:52,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:52,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1649017929, now seen corresponding path program 1 times [2021-08-27 10:41:52,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:52,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543193530] [2021-08-27 10:41:52,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:52,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:52,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:52,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543193530] [2021-08-27 10:41:52,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543193530] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:52,291 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:52,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 10:41:52,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477145430] [2021-08-27 10:41:52,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 10:41:52,292 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:52,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 10:41:52,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:52,293 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:52,560 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2021-08-27 10:41:52,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 10:41:52,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-27 10:41:52,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:52,563 INFO L225 Difference]: With dead ends: 168 [2021-08-27 10:41:52,563 INFO L226 Difference]: Without dead ends: 163 [2021-08-27 10:41:52,564 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:52,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-08-27 10:41:52,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 108. [2021-08-27 10:41:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.231578947368421) internal successors, (117), 107 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2021-08-27 10:41:52,568 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 13 [2021-08-27 10:41:52,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:52,568 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2021-08-27 10:41:52,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2021-08-27 10:41:52,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-27 10:41:52,569 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:52,569 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:52,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-27 10:41:52,570 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:52,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:52,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1943421695, now seen corresponding path program 1 times [2021-08-27 10:41:52,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:52,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567525633] [2021-08-27 10:41:52,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:52,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:52,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:52,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567525633] [2021-08-27 10:41:52,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567525633] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:52,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:52,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 10:41:52,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806945859] [2021-08-27 10:41:52,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-27 10:41:52,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:52,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 10:41:52,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:52,644 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:52,760 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2021-08-27 10:41:52,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 10:41:52,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-27 10:41:52,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:52,761 INFO L225 Difference]: With dead ends: 117 [2021-08-27 10:41:52,761 INFO L226 Difference]: Without dead ends: 116 [2021-08-27 10:41:52,762 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 10:41:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-08-27 10:41:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2021-08-27 10:41:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 106 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2021-08-27 10:41:52,765 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 14 [2021-08-27 10:41:52,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:52,765 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2021-08-27 10:41:52,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2021-08-27 10:41:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-27 10:41:52,767 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:52,767 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:52,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-27 10:41:52,767 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:52,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:52,768 INFO L82 PathProgramCache]: Analyzing trace with hash -57105471, now seen corresponding path program 1 times [2021-08-27 10:41:52,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:52,768 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374508654] [2021-08-27 10:41:52,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:52,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:52,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:52,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374508654] [2021-08-27 10:41:52,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374508654] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:52,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:52,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 10:41:52,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973548444] [2021-08-27 10:41:52,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 10:41:52,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:52,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 10:41:52,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 10:41:52,827 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:53,128 INFO L93 Difference]: Finished difference Result 183 states and 192 transitions. [2021-08-27 10:41:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 10:41:53,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-27 10:41:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:53,129 INFO L225 Difference]: With dead ends: 183 [2021-08-27 10:41:53,129 INFO L226 Difference]: Without dead ends: 179 [2021-08-27 10:41:53,130 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 10:41:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-08-27 10:41:53,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 105. [2021-08-27 10:41:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.2127659574468086) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2021-08-27 10:41:53,133 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 16 [2021-08-27 10:41:53,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:53,134 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2021-08-27 10:41:53,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2021-08-27 10:41:53,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-27 10:41:53,135 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:53,135 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:53,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-27 10:41:53,135 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:53,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:53,136 INFO L82 PathProgramCache]: Analyzing trace with hash -316464313, now seen corresponding path program 1 times [2021-08-27 10:41:53,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:53,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245969690] [2021-08-27 10:41:53,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:53,137 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:53,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:53,181 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245969690] [2021-08-27 10:41:53,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245969690] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:53,181 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:53,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 10:41:53,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477821488] [2021-08-27 10:41:53,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-27 10:41:53,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:53,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 10:41:53,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 10:41:53,183 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:53,282 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2021-08-27 10:41:53,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 10:41:53,282 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-27 10:41:53,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:53,283 INFO L225 Difference]: With dead ends: 114 [2021-08-27 10:41:53,283 INFO L226 Difference]: Without dead ends: 113 [2021-08-27 10:41:53,284 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 10:41:53,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-08-27 10:41:53,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2021-08-27 10:41:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 94 states have (on average 1.202127659574468) internal successors, (113), 103 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2021-08-27 10:41:53,287 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 17 [2021-08-27 10:41:53,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:53,287 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2021-08-27 10:41:53,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,287 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2021-08-27 10:41:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-27 10:41:53,288 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:53,288 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:53,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-27 10:41:53,289 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:53,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:53,289 INFO L82 PathProgramCache]: Analyzing trace with hash -421937723, now seen corresponding path program 1 times [2021-08-27 10:41:53,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:53,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628880891] [2021-08-27 10:41:53,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:53,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:53,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:53,357 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628880891] [2021-08-27 10:41:53,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628880891] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:53,357 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:53,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 10:41:53,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773473606] [2021-08-27 10:41:53,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 10:41:53,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:53,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 10:41:53,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 10:41:53,359 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:53,643 INFO L93 Difference]: Finished difference Result 195 states and 204 transitions. [2021-08-27 10:41:53,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 10:41:53,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-27 10:41:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:53,645 INFO L225 Difference]: With dead ends: 195 [2021-08-27 10:41:53,645 INFO L226 Difference]: Without dead ends: 192 [2021-08-27 10:41:53,646 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.5ms TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 10:41:53,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-08-27 10:41:53,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 96. [2021-08-27 10:41:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 87 states have (on average 1.206896551724138) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2021-08-27 10:41:53,649 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 19 [2021-08-27 10:41:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:53,649 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2021-08-27 10:41:53,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2021-08-27 10:41:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-27 10:41:53,650 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:53,650 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:53,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-27 10:41:53,651 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:53,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:53,652 INFO L82 PathProgramCache]: Analyzing trace with hash -335018609, now seen corresponding path program 1 times [2021-08-27 10:41:53,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:53,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285195743] [2021-08-27 10:41:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:53,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:53,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:53,711 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285195743] [2021-08-27 10:41:53,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285195743] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:53,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:53,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 10:41:53,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162290091] [2021-08-27 10:41:53,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-27 10:41:53,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:53,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 10:41:53,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 10:41:53,713 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:53,820 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2021-08-27 10:41:53,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 10:41:53,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-27 10:41:53,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:53,821 INFO L225 Difference]: With dead ends: 105 [2021-08-27 10:41:53,821 INFO L226 Difference]: Without dead ends: 104 [2021-08-27 10:41:53,821 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 25.4ms TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-08-27 10:41:53,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-08-27 10:41:53,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2021-08-27 10:41:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 94 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2021-08-27 10:41:53,824 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 20 [2021-08-27 10:41:53,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:53,824 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2021-08-27 10:41:53,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2021-08-27 10:41:53,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-27 10:41:53,825 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:53,825 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:53,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-27 10:41:53,826 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:53,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:53,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1422683023, now seen corresponding path program 1 times [2021-08-27 10:41:53,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:53,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007828437] [2021-08-27 10:41:53,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:53,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:53,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:53,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007828437] [2021-08-27 10:41:53,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007828437] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:53,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:53,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 10:41:53,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5375913] [2021-08-27 10:41:53,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 10:41:53,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:53,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 10:41:53,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 10:41:53,892 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:54,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:54,162 INFO L93 Difference]: Finished difference Result 204 states and 213 transitions. [2021-08-27 10:41:54,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 10:41:54,163 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-27 10:41:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:54,164 INFO L225 Difference]: With dead ends: 204 [2021-08-27 10:41:54,164 INFO L226 Difference]: Without dead ends: 202 [2021-08-27 10:41:54,165 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.9ms TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 10:41:54,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-08-27 10:41:54,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 81. [2021-08-27 10:41:54,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 80 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2021-08-27 10:41:54,167 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 22 [2021-08-27 10:41:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:54,168 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2021-08-27 10:41:54,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2021-08-27 10:41:54,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-27 10:41:54,169 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:54,169 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:54,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-27 10:41:54,169 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:54,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:54,170 INFO L82 PathProgramCache]: Analyzing trace with hash 964744341, now seen corresponding path program 1 times [2021-08-27 10:41:54,170 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:54,170 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898879837] [2021-08-27 10:41:54,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:54,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:54,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:54,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898879837] [2021-08-27 10:41:54,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898879837] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:54,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:54,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 10:41:54,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901979437] [2021-08-27 10:41:54,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-27 10:41:54,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:54,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-27 10:41:54,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 10:41:54,253 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:54,386 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2021-08-27 10:41:54,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 10:41:54,386 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-27 10:41:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:54,387 INFO L225 Difference]: With dead ends: 90 [2021-08-27 10:41:54,387 INFO L226 Difference]: Without dead ends: 89 [2021-08-27 10:41:54,388 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.4ms TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2021-08-27 10:41:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-08-27 10:41:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2021-08-27 10:41:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 79 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2021-08-27 10:41:54,390 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 23 [2021-08-27 10:41:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:54,390 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2021-08-27 10:41:54,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2021-08-27 10:41:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-27 10:41:54,391 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:54,392 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:54,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-27 10:41:54,392 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:54,393 INFO L82 PathProgramCache]: Analyzing trace with hash 412788691, now seen corresponding path program 1 times [2021-08-27 10:41:54,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:54,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263808593] [2021-08-27 10:41:54,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:54,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:54,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:54,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263808593] [2021-08-27 10:41:54,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263808593] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:54,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:54,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 10:41:54,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298368165] [2021-08-27 10:41:54,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 10:41:54,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:54,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 10:41:54,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 10:41:54,477 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:54,768 INFO L93 Difference]: Finished difference Result 210 states and 219 transitions. [2021-08-27 10:41:54,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 10:41:54,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-08-27 10:41:54,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:54,770 INFO L225 Difference]: With dead ends: 210 [2021-08-27 10:41:54,770 INFO L226 Difference]: Without dead ends: 209 [2021-08-27 10:41:54,770 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 45.5ms TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 10:41:54,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-08-27 10:41:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 60. [2021-08-27 10:41:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 59 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:54,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2021-08-27 10:41:54,773 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 25 [2021-08-27 10:41:54,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:54,773 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2021-08-27 10:41:54,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:54,774 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2021-08-27 10:41:54,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-27 10:41:54,776 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:54,776 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:54,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-27 10:41:54,777 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:54,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:54,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1222339043, now seen corresponding path program 1 times [2021-08-27 10:41:54,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:54,777 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636542164] [2021-08-27 10:41:54,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:54,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:54,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:54,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:54,893 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636542164] [2021-08-27 10:41:54,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636542164] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:54,893 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:54,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-27 10:41:54,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154370300] [2021-08-27 10:41:54,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-27 10:41:54,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:54,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 10:41:54,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 10:41:54,895 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:55,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:55,023 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2021-08-27 10:41:55,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 10:41:55,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-27 10:41:55,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:55,025 INFO L225 Difference]: With dead ends: 69 [2021-08-27 10:41:55,025 INFO L226 Difference]: Without dead ends: 68 [2021-08-27 10:41:55,025 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 42.3ms TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-08-27 10:41:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-08-27 10:41:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2021-08-27 10:41:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2021-08-27 10:41:55,027 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 26 [2021-08-27 10:41:55,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:55,027 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2021-08-27 10:41:55,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2021-08-27 10:41:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-27 10:41:55,028 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:55,028 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:55,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-27 10:41:55,029 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:55,029 INFO L82 PathProgramCache]: Analyzing trace with hash 896666621, now seen corresponding path program 1 times [2021-08-27 10:41:55,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:55,030 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089824082] [2021-08-27 10:41:55,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:55,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:55,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:55,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089824082] [2021-08-27 10:41:55,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089824082] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:55,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:55,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-27 10:41:55,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832864614] [2021-08-27 10:41:55,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-27 10:41:55,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:55,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 10:41:55,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2021-08-27 10:41:55,130 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:55,563 INFO L93 Difference]: Finished difference Result 200 states and 217 transitions. [2021-08-27 10:41:55,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-08-27 10:41:55,564 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-08-27 10:41:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:55,565 INFO L225 Difference]: With dead ends: 200 [2021-08-27 10:41:55,565 INFO L226 Difference]: Without dead ends: 199 [2021-08-27 10:41:55,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 134.3ms TimeCoverageRelationStatistics Valid=165, Invalid=255, Unknown=0, NotChecked=0, Total=420 [2021-08-27 10:41:55,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-08-27 10:41:55,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 58. [2021-08-27 10:41:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 57 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:55,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2021-08-27 10:41:55,568 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 28 [2021-08-27 10:41:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:55,568 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2021-08-27 10:41:55,569 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2021-08-27 10:41:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 10:41:55,569 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:55,569 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:55,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-27 10:41:55,570 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:55,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2026861636, now seen corresponding path program 1 times [2021-08-27 10:41:55,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:55,571 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240538606] [2021-08-27 10:41:55,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:55,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 10:41:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 10:41:55,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 10:41:55,605 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240538606] [2021-08-27 10:41:55,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240538606] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 10:41:55,606 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 10:41:55,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 10:41:55,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044791246] [2021-08-27 10:41:55,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-27 10:41:55,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 10:41:55,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 10:41:55,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 10:41:55,607 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 10:41:55,727 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2021-08-27 10:41:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 10:41:55,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-27 10:41:55,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-27 10:41:55,728 INFO L225 Difference]: With dead ends: 76 [2021-08-27 10:41:55,729 INFO L226 Difference]: Without dead ends: 75 [2021-08-27 10:41:55,729 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.9ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-27 10:41:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-08-27 10:41:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 61. [2021-08-27 10:41:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 58 states have (on average 1.206896551724138) internal successors, (70), 60 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2021-08-27 10:41:55,731 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 29 [2021-08-27 10:41:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-27 10:41:55,731 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2021-08-27 10:41:55,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 10:41:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2021-08-27 10:41:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-27 10:41:55,732 INFO L504 BasicCegarLoop]: Found error trace [2021-08-27 10:41:55,732 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 10:41:55,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-27 10:41:55,732 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2021-08-27 10:41:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 10:41:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1969538558, now seen corresponding path program 1 times [2021-08-27 10:41:55,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 10:41:55,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436263813] [2021-08-27 10:41:55,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 10:41:55,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 10:41:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 10:41:55,747 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 10:41:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 10:41:55,769 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 10:41:55,769 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-27 10:41:55,770 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,780 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,786 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,786 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,786 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,786 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,786 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,787 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,787 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW [2021-08-27 10:41:55,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-27 10:41:55,792 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-27 10:41:55,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:41:55 BoogieIcfgContainer [2021-08-27 10:41:55,810 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-27 10:41:55,811 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 10:41:55,811 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 10:41:55,811 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 10:41:55,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:41:50" (3/4) ... [2021-08-27 10:41:55,813 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-27 10:41:55,852 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-27 10:41:55,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 10:41:55,854 INFO L168 Benchmark]: Toolchain (without parser) took 6459.74 ms. Allocated memory was 60.8 MB in the beginning and 130.0 MB in the end (delta: 69.2 MB). Free memory was 39.2 MB in the beginning and 61.3 MB in the end (delta: -22.1 MB). Peak memory consumption was 45.7 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:55,855 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 60.8 MB. Free memory was 41.2 MB in the beginning and 41.2 MB in the end (delta: 50.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 10:41:55,855 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.10 ms. Allocated memory is still 60.8 MB. Free memory was 39.0 MB in the beginning and 29.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:55,856 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.36 ms. Allocated memory is still 60.8 MB. Free memory was 29.9 MB in the beginning and 44.4 MB in the end (delta: -14.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:55,856 INFO L168 Benchmark]: Boogie Preprocessor took 33.78 ms. Allocated memory is still 60.8 MB. Free memory was 44.4 MB in the beginning and 43.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 10:41:55,856 INFO L168 Benchmark]: RCFGBuilder took 486.31 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 43.2 MB in the beginning and 52.3 MB in the end (delta: -9.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:55,857 INFO L168 Benchmark]: TraceAbstraction took 5639.59 ms. Allocated memory was 73.4 MB in the beginning and 130.0 MB in the end (delta: 56.6 MB). Free memory was 51.7 MB in the beginning and 63.4 MB in the end (delta: -11.7 MB). Peak memory consumption was 43.4 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:55,857 INFO L168 Benchmark]: Witness Printer took 41.51 ms. Allocated memory is still 130.0 MB. Free memory was 63.4 MB in the beginning and 61.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 10:41:55,859 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 60.8 MB. Free memory was 41.2 MB in the beginning and 41.2 MB in the end (delta: 50.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 181.10 ms. Allocated memory is still 60.8 MB. Free memory was 39.0 MB in the beginning and 29.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.36 ms. Allocated memory is still 60.8 MB. Free memory was 29.9 MB in the beginning and 44.4 MB in the end (delta: -14.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.78 ms. Allocated memory is still 60.8 MB. Free memory was 44.4 MB in the beginning and 43.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 486.31 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 43.2 MB in the beginning and 52.3 MB in the end (delta: -9.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5639.59 ms. Allocated memory was 73.4 MB in the beginning and 130.0 MB in the end (delta: 56.6 MB). Free memory was 51.7 MB in the beginning and 63.4 MB in the end (delta: -11.7 MB). Peak memory consumption was 43.4 MB. Max. memory is 16.1 GB. * Witness Printer took 41.51 ms. Allocated memory is still 130.0 MB. Free memory was 63.4 MB in the beginning and 61.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 65]: integer overflow possible integer overflow possible We found a FailurePath: [L14] int x; [L15] int y; [L16] int z; [L17] y = __VERIFIER_nondet_int() [L18] z = __VERIFIER_nondet_int() [L19] COND FALSE !(__VERIFIER_nondet_int() != 0) [L22] x = -1 [L24] COND FALSE !(x > 0) [L27] EXPR x - 1 [L27] x = x - 1 [L29] COND FALSE !(x > 0) [L32] EXPR x - 1 [L32] x = x - 1 [L34] COND FALSE !(x > 0) [L37] EXPR x - 1 [L37] x = x - 1 [L39] COND FALSE !(x > 0) [L42] EXPR x - 1 [L42] x = x - 1 [L44] COND FALSE !(x > 0) [L47] EXPR x - 1 [L47] x = x - 1 [L49] COND FALSE !(x > 0) [L52] EXPR x - 1 [L52] x = x - 1 [L54] COND FALSE !(x > 0) [L57] EXPR x - 1 [L57] x = x - 1 [L59] COND FALSE !(x > 0) [L62] EXPR x - 1 [L62] x = x - 1 [L64] COND TRUE y<100 && z<100 [L65] y+x - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 50]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 52]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 55]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 57]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 60]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 62]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 65]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 66]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 87 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 5574.0ms, OverallIterations: 20, TraceHistogramMax: 1, EmptinessCheckTime: 20.3ms, AutomataDifference: 4104.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 464 SDtfs, 1989 SDslu, 98 SDs, 0 SdLazy, 4134 SolverSat, 801 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2742.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 480.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=8, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 97.7ms AutomataMinimizationTime, 19 MinimizatonAttempts, 812 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 20.9ms SsaConstructionTime, 121.3ms SatisfiabilityAnalysisTime, 914.6ms InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 1087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-27 10:41:55,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...