./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_04_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_04_good.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 fcf3ee715355b314be221d887b0d3806b0672718c3c3e54a7b9ae3a01b1203d7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:10:52,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:10:52,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 22:10:52,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:10:52,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:10:52,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:10:52,439 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:10:52,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:10:52,440 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:10:52,445 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:10:52,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:10:52,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:10:52,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:10:52,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:10:52,449 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:10:52,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:10:52,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:10:52,450 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:10:52,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:10:52,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:10:52,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:10:52,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:10:52,453 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:10:52,453 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:10:52,453 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:10:52,454 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:10:52,454 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:10:52,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:10:52,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:10:52,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:10:52,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:10:52,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:10:52,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:10:52,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:10:52,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:10:52,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:10:52,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:10:52,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:10:52,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:10:52,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:10:52,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:10:52,459 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> fcf3ee715355b314be221d887b0d3806b0672718c3c3e54a7b9ae3a01b1203d7 [2024-10-11 22:10:52,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:10:52,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:10:52,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:10:52,757 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:10:52,758 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:10:52,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_04_good.i [2024-10-11 22:10:54,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:10:54,529 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:10:54,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_04_good.i [2024-10-11 22:10:54,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ddfb698e/925190975ce34ef1bc91efb6cb6b47b0/FLAGd8b840e11 [2024-10-11 22:10:54,796 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4ddfb698e/925190975ce34ef1bc91efb6cb6b47b0 [2024-10-11 22:10:54,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:10:54,800 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:10:54,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:10:54,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:10:54,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:10:54,809 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:10:54" (1/1) ... [2024-10-11 22:10:54,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113fe486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:54, skipping insertion in model container [2024-10-11 22:10:54,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:10:54" (1/1) ... [2024-10-11 22:10:54,869 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:10:55,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:10:55,629 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:10:55,711 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:10:55,929 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:10:55,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55 WrapperNode [2024-10-11 22:10:55,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:10:55,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:10:55,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:10:55,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:10:55,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:55,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:55,994 INFO L138 Inliner]: procedures = 501, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 111 [2024-10-11 22:10:55,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:10:55,995 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:10:55,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:10:55,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:10:56,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:56,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:56,010 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:56,023 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:10:56,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:56,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:56,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:56,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:56,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:56,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:56,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:10:56,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:10:56,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:10:56,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:10:56,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (1/1) ... [2024-10-11 22:10:56,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:10:56,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:10:56,082 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 22:10:56,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 22:10:56,126 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:10:56,127 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:10:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:10:56,127 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:10:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:10:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:10:56,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:10:56,256 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:10:56,260 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:10:56,415 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 22:10:56,415 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:10:56,454 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:10:56,455 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:10:56,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:10:56 BoogieIcfgContainer [2024-10-11 22:10:56,455 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:10:56,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:10:56,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:10:56,470 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:10:56,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:10:54" (1/3) ... [2024-10-11 22:10:56,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692f4176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:10:56, skipping insertion in model container [2024-10-11 22:10:56,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:10:55" (2/3) ... [2024-10-11 22:10:56,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692f4176 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:10:56, skipping insertion in model container [2024-10-11 22:10:56,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:10:56" (3/3) ... [2024-10-11 22:10:56,474 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_04_good.i [2024-10-11 22:10:56,493 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:10:56,493 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 22:10:56,552 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:10:56,558 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6704b2c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:10:56,558 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 22:10:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-11 22:10:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 22:10:56,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:56,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:56,569 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:56,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1905490627, now seen corresponding path program 1 times [2024-10-11 22:10:56,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:56,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993015308] [2024-10-11 22:10:56,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:56,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:56,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:10:56,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993015308] [2024-10-11 22:10:56,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993015308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:56,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:10:56,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120871257] [2024-10-11 22:10:56,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:56,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:10:56,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:56,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:10:56,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:10:56,954 INFO L87 Difference]: Start difference. First operand has 58 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 45 states have internal predecessors, (56), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:57,016 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2024-10-11 22:10:57,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:10:57,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-11 22:10:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:57,025 INFO L225 Difference]: With dead ends: 59 [2024-10-11 22:10:57,025 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 22:10:57,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:10:57,030 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:57,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 189 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:57,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 22:10:57,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-10-11 22:10:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 40 states have internal predecessors, (50), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:10:57,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 66 transitions. [2024-10-11 22:10:57,063 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 66 transitions. Word has length 11 [2024-10-11 22:10:57,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:57,064 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-10-11 22:10:57,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 66 transitions. [2024-10-11 22:10:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 22:10:57,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:57,066 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:57,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:10:57,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:57,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:57,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1059332771, now seen corresponding path program 1 times [2024-10-11 22:10:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:57,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928141873] [2024-10-11 22:10:57,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:57,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:57,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 22:10:57,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:57,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928141873] [2024-10-11 22:10:57,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928141873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:57,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:57,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:10:57,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507955404] [2024-10-11 22:10:57,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:57,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:57,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:57,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:57,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:57,172 INFO L87 Difference]: Start difference. First operand 51 states and 66 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:57,192 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2024-10-11 22:10:57,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:57,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-10-11 22:10:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:57,196 INFO L225 Difference]: With dead ends: 51 [2024-10-11 22:10:57,196 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 22:10:57,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:57,198 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:57,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 22:10:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 22:10:57,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 39 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 22:10:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 65 transitions. [2024-10-11 22:10:57,212 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 65 transitions. Word has length 12 [2024-10-11 22:10:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:57,212 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 65 transitions. [2024-10-11 22:10:57,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 22:10:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 65 transitions. [2024-10-11 22:10:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 22:10:57,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:57,214 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:57,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:10:57,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:57,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash -450922645, now seen corresponding path program 1 times [2024-10-11 22:10:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548569600] [2024-10-11 22:10:57,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:57,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 22:10:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:10:57,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:57,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548569600] [2024-10-11 22:10:57,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548569600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:57,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:57,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:10:57,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139959720] [2024-10-11 22:10:57,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:57,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:57,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:57,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:57,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:57,289 INFO L87 Difference]: Start difference. First operand 50 states and 65 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:10:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:57,302 INFO L93 Difference]: Finished difference Result 84 states and 106 transitions. [2024-10-11 22:10:57,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:57,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-10-11 22:10:57,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:57,303 INFO L225 Difference]: With dead ends: 84 [2024-10-11 22:10:57,303 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 22:10:57,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:57,304 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:57,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:57,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 22:10:57,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-11 22:10:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.40625) internal successors, (45), 37 states have internal predecessors, (45), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:10:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2024-10-11 22:10:57,311 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 20 [2024-10-11 22:10:57,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:57,312 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2024-10-11 22:10:57,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:10:57,312 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2024-10-11 22:10:57,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 22:10:57,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:57,313 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:57,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:10:57,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:57,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:57,314 INFO L85 PathProgramCache]: Analyzing trace with hash -56135982, now seen corresponding path program 1 times [2024-10-11 22:10:57,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:57,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160958881] [2024-10-11 22:10:57,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:57,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 22:10:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,373 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:10:57,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:57,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160958881] [2024-10-11 22:10:57,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160958881] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:57,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:57,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:10:57,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977482192] [2024-10-11 22:10:57,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:57,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:10:57,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:57,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:10:57,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:10:57,375 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:10:57,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:57,402 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2024-10-11 22:10:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:10:57,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2024-10-11 22:10:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:57,404 INFO L225 Difference]: With dead ends: 47 [2024-10-11 22:10:57,404 INFO L226 Difference]: Without dead ends: 46 [2024-10-11 22:10:57,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:10:57,405 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:57,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 139 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-11 22:10:57,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2024-10-11 22:10:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.375) internal successors, (44), 36 states have internal predecessors, (44), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:10:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2024-10-11 22:10:57,412 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 21 [2024-10-11 22:10:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:57,413 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-10-11 22:10:57,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:10:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2024-10-11 22:10:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 22:10:57,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:57,414 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:57,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:10:57,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:57,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:57,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1740215354, now seen corresponding path program 1 times [2024-10-11 22:10:57,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:57,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801438856] [2024-10-11 22:10:57,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:57,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:57,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 22:10:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:10:57,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:57,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801438856] [2024-10-11 22:10:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801438856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:57,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:57,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:10:57,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422403677] [2024-10-11 22:10:57,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:57,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:57,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:57,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:57,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:57,468 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:10:57,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:57,484 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2024-10-11 22:10:57,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:57,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-10-11 22:10:57,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:57,485 INFO L225 Difference]: With dead ends: 45 [2024-10-11 22:10:57,485 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 22:10:57,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:57,487 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:57,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 22:10:57,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 22:10:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.34375) internal successors, (43), 35 states have internal predecessors, (43), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:10:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 55 transitions. [2024-10-11 22:10:57,495 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 55 transitions. Word has length 22 [2024-10-11 22:10:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:57,495 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 55 transitions. [2024-10-11 22:10:57,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 22:10:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 55 transitions. [2024-10-11 22:10:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 22:10:57,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:57,496 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:57,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 22:10:57,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:57,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1903142089, now seen corresponding path program 1 times [2024-10-11 22:10:57,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:57,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835062365] [2024-10-11 22:10:57,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:57,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 22:10:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:10:57,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:57,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835062365] [2024-10-11 22:10:57,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835062365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:57,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:57,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:10:57,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697439483] [2024-10-11 22:10:57,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:57,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:10:57,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:57,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:10:57,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:57,565 INFO L87 Difference]: Start difference. First operand 44 states and 55 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:10:57,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:57,590 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2024-10-11 22:10:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:10:57,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-10-11 22:10:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:57,591 INFO L225 Difference]: With dead ends: 84 [2024-10-11 22:10:57,592 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 22:10:57,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:10:57,593 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:57,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 42 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 22:10:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 22:10:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:10:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2024-10-11 22:10:57,600 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 23 [2024-10-11 22:10:57,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:57,600 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2024-10-11 22:10:57,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 22:10:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2024-10-11 22:10:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 22:10:57,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:57,602 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:57,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 22:10:57,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:57,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1334380327, now seen corresponding path program 1 times [2024-10-11 22:10:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:57,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885920306] [2024-10-11 22:10:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:57,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 22:10:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 22:10:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:10:57,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:57,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885920306] [2024-10-11 22:10:57,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885920306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:57,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:57,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:10:57,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336681495] [2024-10-11 22:10:57,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:57,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:10:57,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:57,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:10:57,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:10:57,731 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:10:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:57,764 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2024-10-11 22:10:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:10:57,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2024-10-11 22:10:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:57,766 INFO L225 Difference]: With dead ends: 44 [2024-10-11 22:10:57,766 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 22:10:57,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:10:57,769 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:57,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 22:10:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-11 22:10:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 22:10:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-10-11 22:10:57,776 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 30 [2024-10-11 22:10:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:57,777 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-10-11 22:10:57,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-11 22:10:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-10-11 22:10:57,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-11 22:10:57,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:10:57,778 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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, 1, 1] [2024-10-11 22:10:57,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 22:10:57,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:10:57,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:10:57,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1535877418, now seen corresponding path program 1 times [2024-10-11 22:10:57,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:10:57,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760815019] [2024-10-11 22:10:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:10:57,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:10:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:10:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 22:10:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 22:10:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 22:10:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:10:57,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 22:10:57,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:10:57,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760815019] [2024-10-11 22:10:57,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760815019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:10:57,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:10:57,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:10:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692064263] [2024-10-11 22:10:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:10:57,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:10:57,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:10:57,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:10:57,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:10:57,895 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 22:10:57,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:10:57,922 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-10-11 22:10:57,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:10:57,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-10-11 22:10:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:10:57,923 INFO L225 Difference]: With dead ends: 42 [2024-10-11 22:10:57,924 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:10:57,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:10:57,925 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:10:57,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 123 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:10:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:10:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:10:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2024-10-11 22:10:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:10:57,930 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2024-10-11 22:10:57,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:10:57,930 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:10:57,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 22:10:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:10:57,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:10:57,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 22:10:57,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 22:10:57,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 22:10:57,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 22:10:57,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 22:10:57,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 22:10:57,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 22:10:57,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 22:10:57,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 22:10:57,941 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:10:57,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:10:58,027 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:10:58,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:10:58 BoogieIcfgContainer [2024-10-11 22:10:58,043 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:10:58,043 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:10:58,044 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:10:58,044 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:10:58,045 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:10:56" (3/4) ... [2024-10-11 22:10:58,046 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:10:58,050 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:10:58,050 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:10:58,057 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 22:10:58,057 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 22:10:58,058 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 22:10:58,058 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:10:58,156 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 22:10:58,156 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 22:10:58,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:10:58,157 INFO L158 Benchmark]: Toolchain (without parser) took 3357.30ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 100.5MB in the beginning and 144.6MB in the end (delta: -44.2MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2024-10-11 22:10:58,160 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:10:58,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1129.53ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 100.1MB in the beginning and 173.2MB in the end (delta: -73.2MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2024-10-11 22:10:58,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.29ms. Allocated memory is still 237.0MB. Free memory was 173.2MB in the beginning and 170.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:10:58,161 INFO L158 Benchmark]: Boogie Preprocessor took 44.96ms. Allocated memory is still 237.0MB. Free memory was 170.1MB in the beginning and 168.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:10:58,161 INFO L158 Benchmark]: RCFGBuilder took 414.00ms. Allocated memory is still 237.0MB. Free memory was 168.0MB in the beginning and 149.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 22:10:58,161 INFO L158 Benchmark]: TraceAbstraction took 1578.43ms. Allocated memory is still 237.0MB. Free memory was 149.1MB in the beginning and 149.9MB in the end (delta: -774.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:10:58,161 INFO L158 Benchmark]: Witness Printer took 113.29ms. Allocated memory is still 237.0MB. Free memory was 149.9MB in the beginning and 144.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 22:10:58,162 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1129.53ms. Allocated memory was 159.4MB in the beginning and 237.0MB in the end (delta: 77.6MB). Free memory was 100.1MB in the beginning and 173.2MB in the end (delta: -73.2MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.29ms. Allocated memory is still 237.0MB. Free memory was 173.2MB in the beginning and 170.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.96ms. Allocated memory is still 237.0MB. Free memory was 170.1MB in the beginning and 168.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 414.00ms. Allocated memory is still 237.0MB. Free memory was 168.0MB in the beginning and 149.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1578.43ms. Allocated memory is still 237.0MB. Free memory was 149.1MB in the beginning and 149.9MB in the end (delta: -774.1kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 113.29ms. Allocated memory is still 237.0MB. Free memory was 149.9MB in the beginning and 144.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1566]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1588]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1588]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1613]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1630]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 888 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 480 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 408 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 239 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 26/26 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 22:10:58,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE