./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_08_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_08_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 49988e9645477874282b5a4c8f3947bb845a29899f2cd8be15967a5457c91d03 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 22:10:59,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 22:10:59,625 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:59,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 22:10:59,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 22:10:59,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 22:10:59,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 22:10:59,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 22:10:59,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 22:10:59,670 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 22:10:59,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 22:10:59,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 22:10:59,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 22:10:59,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 22:10:59,672 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 22:10:59,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 22:10:59,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 22:10:59,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 22:10:59,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 22:10:59,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 22:10:59,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 22:10:59,678 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 22:10:59,679 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 22:10:59,679 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 22:10:59,679 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 22:10:59,679 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 22:10:59,680 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 22:10:59,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 22:10:59,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 22:10:59,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 22:10:59,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 22:10:59,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:10:59,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 22:10:59,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 22:10:59,682 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 22:10:59,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 22:10:59,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 22:10:59,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 22:10:59,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 22:10:59,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 22:10:59,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 22:10:59,685 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 -> 49988e9645477874282b5a4c8f3947bb845a29899f2cd8be15967a5457c91d03 [2024-10-11 22:10:59,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 22:11:00,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 22:11:00,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 22:11:00,009 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 22:11:00,010 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 22:11:00,011 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_08_good.i [2024-10-11 22:11:01,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 22:11:01,827 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 22:11:01,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_fscanf_postinc_08_good.i [2024-10-11 22:11:01,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/db8edd678/cc5c2964080443ec943a747b3f418905/FLAGbbd3bcfdd [2024-10-11 22:11:01,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/db8edd678/cc5c2964080443ec943a747b3f418905 [2024-10-11 22:11:01,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 22:11:01,888 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 22:11:01,890 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 22:11:01,890 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 22:11:01,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 22:11:01,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:11:01" (1/1) ... [2024-10-11 22:11:01,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f10cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:01, skipping insertion in model container [2024-10-11 22:11:01,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:11:01" (1/1) ... [2024-10-11 22:11:01,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 22:11:02,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:11:02,791 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 22:11:02,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 22:11:02,982 INFO L204 MainTranslator]: Completed translation [2024-10-11 22:11:02,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02 WrapperNode [2024-10-11 22:11:02,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 22:11:02,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 22:11:02,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 22:11:02,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 22:11:02,991 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:11:02" (1/1) ... [2024-10-11 22:11:03,026 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:11:02" (1/1) ... [2024-10-11 22:11:03,058 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2024-10-11 22:11:03,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 22:11:03,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 22:11:03,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 22:11:03,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 22:11:03,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02" (1/1) ... [2024-10-11 22:11:03,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02" (1/1) ... [2024-10-11 22:11:03,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02" (1/1) ... [2024-10-11 22:11:03,093 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 22:11:03,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02" (1/1) ... [2024-10-11 22:11:03,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02" (1/1) ... [2024-10-11 22:11:03,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02" (1/1) ... [2024-10-11 22:11:03,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02" (1/1) ... [2024-10-11 22:11:03,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02" (1/1) ... [2024-10-11 22:11:03,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02" (1/1) ... [2024-10-11 22:11:03,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 22:11:03,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 22:11:03,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 22:11:03,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 22:11:03,122 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02" (1/1) ... [2024-10-11 22:11:03,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 22:11:03,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:11:03,209 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:11:03,238 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:11:03,286 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 22:11:03,287 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 22:11:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 22:11:03,287 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 22:11:03,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 22:11:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 22:11:03,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 22:11:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-10-11 22:11:03,288 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-10-11 22:11:03,288 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2024-10-11 22:11:03,288 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2024-10-11 22:11:03,427 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 22:11:03,429 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 22:11:03,616 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 22:11:03,616 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 22:11:03,656 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 22:11:03,656 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 22:11:03,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:03 BoogieIcfgContainer [2024-10-11 22:11:03,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 22:11:03,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 22:11:03,661 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 22:11:03,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 22:11:03,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:11:01" (1/3) ... [2024-10-11 22:11:03,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ef8494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:11:03, skipping insertion in model container [2024-10-11 22:11:03,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:11:02" (2/3) ... [2024-10-11 22:11:03,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42ef8494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:11:03, skipping insertion in model container [2024-10-11 22:11:03,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:03" (3/3) ... [2024-10-11 22:11:03,669 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_fscanf_postinc_08_good.i [2024-10-11 22:11:03,686 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 22:11:03,686 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 22:11:03,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 22:11:03,754 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;@4695ab6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 22:11:03,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 22:11:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 55 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-11 22:11:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 22:11:03,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:03,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:03,768 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:11:03,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:03,774 INFO L85 PathProgramCache]: Analyzing trace with hash 55766273, now seen corresponding path program 1 times [2024-10-11 22:11:03,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:03,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680043810] [2024-10-11 22:11:03,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,213 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:11:04,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:04,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680043810] [2024-10-11 22:11:04,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680043810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:04,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:04,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:11:04,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184112673] [2024-10-11 22:11:04,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:04,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:04,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:04,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:04,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:04,246 INFO L87 Difference]: Start difference. First operand has 78 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 55 states have internal predecessors, (66), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 22:11:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:04,328 INFO L93 Difference]: Finished difference Result 79 states and 103 transitions. [2024-10-11 22:11:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:04,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 19 [2024-10-11 22:11:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:04,337 INFO L225 Difference]: With dead ends: 79 [2024-10-11 22:11:04,338 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 22:11:04,340 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:11:04,343 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 5 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:04,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 257 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 22:11:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 22:11:04,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-11 22:11:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 50 states have internal predecessors, (60), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:11:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2024-10-11 22:11:04,383 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 19 [2024-10-11 22:11:04,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:04,385 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2024-10-11 22:11:04,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 22:11:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2024-10-11 22:11:04,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 22:11:04,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:04,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:04,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 22:11:04,391 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:11:04,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1728754533, now seen corresponding path program 1 times [2024-10-11 22:11:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:04,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801984319] [2024-10-11 22:11:04,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:04,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,483 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:11:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:04,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801984319] [2024-10-11 22:11:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801984319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:04,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:04,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:11:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752480883] [2024-10-11 22:11:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:04,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:11:04,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:04,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:11:04,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:11:04,488 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:11:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:04,521 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2024-10-11 22:11:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:11:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 20 [2024-10-11 22:11:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:04,523 INFO L225 Difference]: With dead ends: 71 [2024-10-11 22:11:04,523 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 22:11:04,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:11:04,525 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:04,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:04,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 22:11:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-11 22:11:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 49 states have internal predecessors, (59), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:11:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-10-11 22:11:04,548 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 20 [2024-10-11 22:11:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:04,548 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-10-11 22:11:04,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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:11:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-10-11 22:11:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 22:11:04,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:04,550 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 22:11:04,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 22:11:04,551 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:11:04,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash -447765931, now seen corresponding path program 1 times [2024-10-11 22:11:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:04,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372036275] [2024-10-11 22:11:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:04,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 22:11:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 22:11:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 22:11:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 22:11:04,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:04,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372036275] [2024-10-11 22:11:04,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372036275] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:04,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:04,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:11:04,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544923843] [2024-10-11 22:11:04,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:04,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:04,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:04,724 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 22:11:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:04,767 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2024-10-11 22:11:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:04,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 36 [2024-10-11 22:11:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:04,769 INFO L225 Difference]: With dead ends: 122 [2024-10-11 22:11:04,769 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 22:11:04,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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:11:04,771 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:04,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 240 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 22:11:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 22:11:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 48 states have internal predecessors, (57), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 22:11:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-10-11 22:11:04,806 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 36 [2024-10-11 22:11:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:04,806 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-10-11 22:11:04,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 22:11:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-10-11 22:11:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 22:11:04,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:04,808 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2024-10-11 22:11:04,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 22:11:04,811 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:11:04,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:04,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1190157882, now seen corresponding path program 1 times [2024-10-11 22:11:04,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:04,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892961002] [2024-10-11 22:11:04,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:04,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 22:11:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 22:11:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:11:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:04,963 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:11:04,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:04,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892961002] [2024-10-11 22:11:04,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892961002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:04,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:04,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:11:04,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249362938] [2024-10-11 22:11:04,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:04,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:04,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:04,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:04,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:04,967 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 22:11:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:05,015 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-10-11 22:11:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:05,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2024-10-11 22:11:05,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:05,017 INFO L225 Difference]: With dead ends: 69 [2024-10-11 22:11:05,017 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 22:11:05,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 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:11:05,018 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:05,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 219 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 22:11:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-10-11 22:11:05,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.302325581395349) internal successors, (56), 47 states have internal predecessors, (56), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 22:11:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-10-11 22:11:05,028 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 37 [2024-10-11 22:11:05,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:05,029 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-10-11 22:11:05,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-11 22:11:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-10-11 22:11:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 22:11:05,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:05,032 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2024-10-11 22:11:05,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 22:11:05,032 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:11:05,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:05,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1759811224, now seen corresponding path program 1 times [2024-10-11 22:11:05,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:05,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416687064] [2024-10-11 22:11:05,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 22:11:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 22:11:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:11:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,121 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:11:05,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416687064] [2024-10-11 22:11:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416687064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:05,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:05,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 22:11:05,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937271084] [2024-10-11 22:11:05,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:05,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 22:11:05,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:05,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 22:11:05,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 22:11:05,125 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 22:11:05,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:05,145 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2024-10-11 22:11:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 22:11:05,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2024-10-11 22:11:05,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:05,148 INFO L225 Difference]: With dead ends: 67 [2024-10-11 22:11:05,148 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 22:11:05,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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:11:05,151 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:05,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:05,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 22:11:05,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 22:11:05,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 46 states have internal predecessors, (55), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 22:11:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-10-11 22:11:05,161 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 38 [2024-10-11 22:11:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:05,161 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-10-11 22:11:05,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-11 22:11:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2024-10-11 22:11:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 22:11:05,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:05,163 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:05,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 22:11:05,163 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:11:05,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1336940069, now seen corresponding path program 1 times [2024-10-11 22:11:05,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:05,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861644329] [2024-10-11 22:11:05,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:05,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 22:11:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 22:11:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:11:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 22:11:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 22:11:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 22:11:05,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861644329] [2024-10-11 22:11:05,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861644329] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 22:11:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793955642] [2024-10-11 22:11:05,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:05,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:11:05,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:11:05,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 22:11:05,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 22:11:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 22:11:05,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:11:05,428 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 22:11:05,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:11:05,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793955642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:05,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 22:11:05,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 22:11:05,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587701625] [2024-10-11 22:11:05,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:05,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:05,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:05,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:05,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:11:05,431 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 22:11:05,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:05,455 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2024-10-11 22:11:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:05,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 47 [2024-10-11 22:11:05,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:05,457 INFO L225 Difference]: With dead ends: 102 [2024-10-11 22:11:05,457 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 22:11:05,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:11:05,458 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:05,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 22:11:05,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 22:11:05,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.255813953488372) internal successors, (54), 46 states have internal predecessors, (54), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 22:11:05,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-10-11 22:11:05,465 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 47 [2024-10-11 22:11:05,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:05,466 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-10-11 22:11:05,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 22:11:05,466 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-10-11 22:11:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 22:11:05,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:05,467 INFO L215 NwaCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:05,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 22:11:05,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:11:05,672 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:11:05,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:05,672 INFO L85 PathProgramCache]: Analyzing trace with hash 798701980, now seen corresponding path program 1 times [2024-10-11 22:11:05,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:05,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031487702] [2024-10-11 22:11:05,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:05,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 22:11:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 22:11:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:11:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 22:11:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 22:11:05,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 22:11:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 22:11:05,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:05,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031487702] [2024-10-11 22:11:05,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031487702] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:05,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:05,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:11:05,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519544992] [2024-10-11 22:11:05,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:05,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:05,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:05,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:05,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:05,794 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 22:11:05,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:05,847 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2024-10-11 22:11:05,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:05,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 54 [2024-10-11 22:11:05,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:05,850 INFO L225 Difference]: With dead ends: 74 [2024-10-11 22:11:05,850 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 22:11:05,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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:11:05,852 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:05,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 224 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 22:11:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2024-10-11 22:11:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 50 states have internal predecessors, (59), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 22:11:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2024-10-11 22:11:05,864 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 54 [2024-10-11 22:11:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:05,864 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2024-10-11 22:11:05,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 22:11:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2024-10-11 22:11:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 22:11:05,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:05,866 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:05,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 22:11:05,867 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:11:05,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash 306557235, now seen corresponding path program 1 times [2024-10-11 22:11:05,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:05,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484202773] [2024-10-11 22:11:05,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:05,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 22:11:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 22:11:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:11:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 22:11:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 22:11:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 22:11:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 22:11:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:05,993 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 22:11:05,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:05,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484202773] [2024-10-11 22:11:05,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484202773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:05,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:05,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 22:11:05,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185158711] [2024-10-11 22:11:05,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:05,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:05,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:05,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:05,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:05,999 INFO L87 Difference]: Start difference. First operand 71 states and 91 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 22:11:06,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:06,026 INFO L93 Difference]: Finished difference Result 92 states and 113 transitions. [2024-10-11 22:11:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:06,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 60 [2024-10-11 22:11:06,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:06,029 INFO L225 Difference]: With dead ends: 92 [2024-10-11 22:11:06,029 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 22:11:06,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 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:11:06,030 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:06,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:06,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 22:11:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 22:11:06,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 22:11:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2024-10-11 22:11:06,038 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 60 [2024-10-11 22:11:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:06,039 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2024-10-11 22:11:06,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 22:11:06,039 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2024-10-11 22:11:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 22:11:06,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:06,041 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 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:11:06,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 22:11:06,041 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:11:06,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash 611705301, now seen corresponding path program 1 times [2024-10-11 22:11:06,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:06,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092493465] [2024-10-11 22:11:06,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:06,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 22:11:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 22:11:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:11:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 22:11:06,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 22:11:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 22:11:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 22:11:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 22:11:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-11 22:11:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:06,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092493465] [2024-10-11 22:11:06,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092493465] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 22:11:06,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604885065] [2024-10-11 22:11:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:06,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:11:06,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:11:06,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 22:11:06,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 22:11:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 22:11:06,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:11:06,312 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 22:11:06,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:11:06,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604885065] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:06,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 22:11:06,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 22:11:06,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990638114] [2024-10-11 22:11:06,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:06,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:06,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:06,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:06,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:11:06,315 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 22:11:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:06,339 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2024-10-11 22:11:06,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:06,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 65 [2024-10-11 22:11:06,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:06,341 INFO L225 Difference]: With dead ends: 75 [2024-10-11 22:11:06,341 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 22:11:06,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:11:06,342 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:06,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 22:11:06,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 22:11:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 43 states have internal predecessors, (49), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 22:11:06,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2024-10-11 22:11:06,348 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 65 [2024-10-11 22:11:06,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:06,349 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2024-10-11 22:11:06,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 22:11:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2024-10-11 22:11:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 22:11:06,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:06,350 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 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, 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:11:06,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 22:11:06,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:11:06,555 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:11:06,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:06,555 INFO L85 PathProgramCache]: Analyzing trace with hash -812326662, now seen corresponding path program 1 times [2024-10-11 22:11:06,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:06,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36041665] [2024-10-11 22:11:06,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:06,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 22:11:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 22:11:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:11:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 22:11:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 22:11:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 22:11:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 22:11:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 22:11:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 22:11:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-11 22:11:06,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:06,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36041665] [2024-10-11 22:11:06,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36041665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:06,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 22:11:06,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 22:11:06,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266589183] [2024-10-11 22:11:06,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:06,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:06,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:06,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:06,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 22:11:06,665 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 22:11:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:06,695 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2024-10-11 22:11:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:06,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 71 [2024-10-11 22:11:06,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:06,696 INFO L225 Difference]: With dead ends: 69 [2024-10-11 22:11:06,697 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 22:11:06,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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:11:06,698 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 1 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:06,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 215 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 22:11:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 22:11:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 43 states have internal predecessors, (48), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 22:11:06,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2024-10-11 22:11:06,709 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 71 [2024-10-11 22:11:06,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:06,709 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2024-10-11 22:11:06,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 22:11:06,710 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2024-10-11 22:11:06,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 22:11:06,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 22:11:06,711 INFO L215 NwaCegarLoop]: trace histogram [6, 3, 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, 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:11:06,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 22:11:06,711 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 22:11:06,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 22:11:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash 962680700, now seen corresponding path program 1 times [2024-10-11 22:11:06,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 22:11:06,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000702622] [2024-10-11 22:11:06,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:06,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 22:11:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 22:11:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 22:11:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 22:11:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 22:11:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 22:11:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 22:11:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 22:11:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 22:11:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 22:11:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 22:11:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 22:11:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 22:11:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,846 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-11 22:11:06,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 22:11:06,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000702622] [2024-10-11 22:11:06,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000702622] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 22:11:06,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488547958] [2024-10-11 22:11:06,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 22:11:06,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:11:06,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 22:11:06,849 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 22:11:06,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 22:11:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 22:11:06,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 22:11:06,946 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 22:11:06,974 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 22:11:06,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 22:11:06,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488547958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 22:11:06,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 22:11:06,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 22:11:06,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065896503] [2024-10-11 22:11:06,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 22:11:06,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 22:11:06,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 22:11:06,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 22:11:06,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:11:06,977 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 22:11:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 22:11:06,995 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2024-10-11 22:11:06,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 22:11:06,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 71 [2024-10-11 22:11:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 22:11:06,996 INFO L225 Difference]: With dead ends: 64 [2024-10-11 22:11:06,996 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 22:11:06,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 22:11:06,997 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 22:11:06,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 22:11:06,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 22:11:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 22:11:06,998 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:11:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 22:11:06,998 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 71 [2024-10-11 22:11:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 22:11:06,998 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 22:11:06,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 22:11:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 22:11:06,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 22:11:07,003 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 22:11:07,004 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 22:11:07,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 22:11:07,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 22:11:07,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 22:11:07,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 22:11:07,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 22:11:07,005 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 22:11:07,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 22:11:07,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 22:11:07,209 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 22:11:07,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 22:11:07,260 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 22:11:07,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:11:07 BoogieIcfgContainer [2024-10-11 22:11:07,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 22:11:07,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 22:11:07,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 22:11:07,281 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 22:11:07,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:11:03" (3/4) ... [2024-10-11 22:11:07,283 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 22:11:07,287 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 22:11:07,287 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2024-10-11 22:11:07,287 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 22:11:07,288 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2024-10-11 22:11:07,295 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-11 22:11:07,296 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 22:11:07,296 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 22:11:07,296 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 22:11:07,390 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 22:11:07,390 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 22:11:07,390 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 22:11:07,391 INFO L158 Benchmark]: Toolchain (without parser) took 5502.63ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 136.3MB in the beginning and 121.4MB in the end (delta: 14.8MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-10-11 22:11:07,391 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 138.4MB. Free memory was 109.5MB in the beginning and 109.4MB in the end (delta: 153.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 22:11:07,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1093.44ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 74.6MB in the end (delta: 61.5MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-10-11 22:11:07,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.45ms. Allocated memory is still 167.8MB. Free memory was 74.6MB in the beginning and 71.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:11:07,392 INFO L158 Benchmark]: Boogie Preprocessor took 55.82ms. Allocated memory is still 167.8MB. Free memory was 70.7MB in the beginning and 68.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 22:11:07,392 INFO L158 Benchmark]: RCFGBuilder took 538.94ms. Allocated memory is still 167.8MB. Free memory was 68.6MB in the beginning and 118.1MB in the end (delta: -49.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 22:11:07,393 INFO L158 Benchmark]: TraceAbstraction took 3618.46ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 117.0MB in the beginning and 128.8MB in the end (delta: -11.8MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-10-11 22:11:07,393 INFO L158 Benchmark]: Witness Printer took 110.12ms. Allocated memory is still 201.3MB. Free memory was 128.8MB in the beginning and 121.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 22:11:07,395 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.20ms. Allocated memory is still 138.4MB. Free memory was 109.5MB in the beginning and 109.4MB in the end (delta: 153.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1093.44ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 74.6MB in the end (delta: 61.5MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.45ms. Allocated memory is still 167.8MB. Free memory was 74.6MB in the beginning and 71.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.82ms. Allocated memory is still 167.8MB. Free memory was 70.7MB in the beginning and 68.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 538.94ms. Allocated memory is still 167.8MB. Free memory was 68.6MB in the beginning and 118.1MB in the end (delta: -49.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3618.46ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 117.0MB in the beginning and 128.8MB in the end (delta: -11.8MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Witness Printer took 110.12ms. Allocated memory is still 201.3MB. Free memory was 128.8MB in the beginning and 121.4MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. 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: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1572]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1594]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1619]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1636]: 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 5 procedures, 78 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 11, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 2318 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1469 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 226 IncrementalHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 849 mSDtfsCounter, 226 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 42, 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, 11 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 701 NumberOfCodeBlocks, 701 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 687 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 597 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 264/268 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 - ProcedureContractResult [Line: 1552]: Procedure Contract for staticReturnsFalse Derived contract for procedure staticReturnsFalse. Ensures: (\result == 0) - ProcedureContractResult [Line: 1548]: Procedure Contract for staticReturnsTrue Derived contract for procedure staticReturnsTrue. Ensures: (1 <= \result) RESULT: Ultimate proved your program to be correct! [2024-10-11 22:11:07,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE