./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/CWE191_Integer_Underflow__int_fscanf_postdec_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/CWE191_Integer_Underflow__int_fscanf_postdec_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 dda1dbc018b4bfc76fcbb38c3b9fdc56007312d0375f9717b22212f88b410ef7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 23:06:31,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 23:06:31,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 23:06:31,362 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 23:06:31,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 23:06:31,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 23:06:31,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 23:06:31,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 23:06:31,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 23:06:31,399 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 23:06:31,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 23:06:31,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 23:06:31,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 23:06:31,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 23:06:31,403 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 23:06:31,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 23:06:31,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 23:06:31,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 23:06:31,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 23:06:31,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 23:06:31,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 23:06:31,409 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 23:06:31,410 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 23:06:31,410 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 23:06:31,411 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 23:06:31,411 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 23:06:31,411 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 23:06:31,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 23:06:31,412 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 23:06:31,412 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 23:06:31,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 23:06:31,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:06:31,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 23:06:31,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 23:06:31,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 23:06:31,413 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 23:06:31,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 23:06:31,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 23:06:31,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 23:06:31,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 23:06:31,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 23:06:31,416 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 -> dda1dbc018b4bfc76fcbb38c3b9fdc56007312d0375f9717b22212f88b410ef7 [2024-10-11 23:06:31,715 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 23:06:31,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 23:06:31,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 23:06:31,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 23:06:31,746 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 23:06:31,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_08_good.i [2024-10-11 23:06:33,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 23:06:33,525 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 23:06:33,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_08_good.i [2024-10-11 23:06:33,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9cf747684/3b106ecdcb8a4fdc8d14e7f3dbf3fbdf/FLAGd32104fa7 [2024-10-11 23:06:33,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9cf747684/3b106ecdcb8a4fdc8d14e7f3dbf3fbdf [2024-10-11 23:06:33,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 23:06:33,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 23:06:33,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 23:06:33,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 23:06:33,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 23:06:33,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:06:33" (1/1) ... [2024-10-11 23:06:33,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655368a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:33, skipping insertion in model container [2024-10-11 23:06:33,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:06:33" (1/1) ... [2024-10-11 23:06:33,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 23:06:34,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:06:34,560 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 23:06:34,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 23:06:34,754 INFO L204 MainTranslator]: Completed translation [2024-10-11 23:06:34,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34 WrapperNode [2024-10-11 23:06:34,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 23:06:34,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 23:06:34,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 23:06:34,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 23:06:34,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,801 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,835 INFO L138 Inliner]: procedures = 503, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 141 [2024-10-11 23:06:34,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 23:06:34,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 23:06:34,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 23:06:34,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 23:06:34,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,880 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-11 23:06:34,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,892 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 23:06:34,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 23:06:34,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 23:06:34,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 23:06:34,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (1/1) ... [2024-10-11 23:06:34,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 23:06:34,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:06:34,942 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 23:06:34,948 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 23:06:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2024-10-11 23:06:35,025 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2024-10-11 23:06:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2024-10-11 23:06:35,025 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2024-10-11 23:06:35,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 23:06:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 23:06:35,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 23:06:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsTrue [2024-10-11 23:06:35,026 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsTrue [2024-10-11 23:06:35,026 INFO L130 BoogieDeclarations]: Found specification of procedure staticReturnsFalse [2024-10-11 23:06:35,026 INFO L138 BoogieDeclarations]: Found implementation of procedure staticReturnsFalse [2024-10-11 23:06:35,221 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 23:06:35,223 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 23:06:35,436 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-10-11 23:06:35,436 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 23:06:35,480 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 23:06:35,480 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 23:06:35,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:06:35 BoogieIcfgContainer [2024-10-11 23:06:35,481 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 23:06:35,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 23:06:35,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 23:06:35,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 23:06:35,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:06:33" (1/3) ... [2024-10-11 23:06:35,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eab164f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:06:35, skipping insertion in model container [2024-10-11 23:06:35,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:06:34" (2/3) ... [2024-10-11 23:06:35,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eab164f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:06:35, skipping insertion in model container [2024-10-11 23:06:35,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:06:35" (3/3) ... [2024-10-11 23:06:35,491 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_postdec_08_good.i [2024-10-11 23:06:35,509 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 23:06:35,510 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-10-11 23:06:35,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 23:06:35,591 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;@37d5a205, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 23:06:35,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 23:06:35,597 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 23:06:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 23:06:35,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:35,607 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 23:06:35,607 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 23:06:35,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash 55766273, now seen corresponding path program 1 times [2024-10-11 23:06:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:35,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368176662] [2024-10-11 23:06:35,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:35,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:35,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:35,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:35,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:35,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,000 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 23:06:36,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:36,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368176662] [2024-10-11 23:06:36,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368176662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:36,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:36,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:06:36,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892835216] [2024-10-11 23:06:36,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:36,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:06:36,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:36,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:06:36,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:06:36,038 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 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 23:06:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:36,110 INFO L93 Difference]: Finished difference Result 78 states and 102 transitions. [2024-10-11 23:06:36,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:06:36,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 19 [2024-10-11 23:06:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:36,120 INFO L225 Difference]: With dead ends: 78 [2024-10-11 23:06:36,120 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 23:06:36,123 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 23:06:36,126 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:36,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 181 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 23:06:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 23:06:36,172 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 23:06:36,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2024-10-11 23:06:36,178 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 19 [2024-10-11 23:06:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:36,181 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2024-10-11 23:06:36,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 23:06:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2024-10-11 23:06:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 23:06:36,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:36,184 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 23:06:36,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 23:06:36,185 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 23:06:36,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:36,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1728754533, now seen corresponding path program 1 times [2024-10-11 23:06:36,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:36,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618074670] [2024-10-11 23:06:36,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:36,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:36,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,364 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 23:06:36,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:36,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618074670] [2024-10-11 23:06:36,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618074670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:36,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:36,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:36,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956972287] [2024-10-11 23:06:36,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:36,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:36,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:36,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:36,369 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 23:06:36,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:36,419 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2024-10-11 23:06:36,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:36,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 20 [2024-10-11 23:06:36,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:36,422 INFO L225 Difference]: With dead ends: 72 [2024-10-11 23:06:36,422 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 23:06:36,422 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 23:06:36,423 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 236 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 23:06:36,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 236 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:36,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 23:06:36,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-10-11 23:06:36,441 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 23:06:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-10-11 23:06:36,445 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 20 [2024-10-11 23:06:36,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:36,446 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-10-11 23:06:36,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 23:06:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-10-11 23:06:36,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-11 23:06:36,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:36,450 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 23:06:36,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 23:06:36,450 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 23:06:36,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:36,451 INFO L85 PathProgramCache]: Analyzing trace with hash -447765931, now seen corresponding path program 1 times [2024-10-11 23:06:36,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:36,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041958347] [2024-10-11 23:06:36,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:36,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 23:06:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 23:06:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 23:06:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,713 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 23:06:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:36,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041958347] [2024-10-11 23:06:36,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041958347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:36,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:36,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:06:36,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492698174] [2024-10-11 23:06:36,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:36,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:36,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:36,718 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 23:06:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:36,766 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2024-10-11 23:06:36,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:36,767 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 23:06:36,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:36,769 INFO L225 Difference]: With dead ends: 122 [2024-10-11 23:06:36,769 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 23:06:36,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 23:06:36,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 23:06:36,774 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 23:06:36,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 23:06:36,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 23:06:36,785 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 23:06:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-10-11 23:06:36,787 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 36 [2024-10-11 23:06:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:36,787 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-10-11 23:06:36,788 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 23:06:36,788 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-10-11 23:06:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 23:06:36,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:36,790 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 23:06:36,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 23:06:36,790 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 23:06:36,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:36,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1190157882, now seen corresponding path program 1 times [2024-10-11 23:06:36,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:36,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273927154] [2024-10-11 23:06:36,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:36,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:36,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:06:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:06:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:06:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:36,917 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 23:06:36,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:36,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273927154] [2024-10-11 23:06:36,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273927154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:36,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:36,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 23:06:36,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968866586] [2024-10-11 23:06:36,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:36,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 23:06:36,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:36,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 23:06:36,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 23:06:36,921 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 23:06:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:36,951 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2024-10-11 23:06:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 23:06:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 37 [2024-10-11 23:06:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:36,954 INFO L225 Difference]: With dead ends: 68 [2024-10-11 23:06:36,955 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 23:06:36,955 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 23:06:36,958 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:36,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 155 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:36,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 23:06:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-11 23:06:36,974 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 23:06:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-10-11 23:06:36,979 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 37 [2024-10-11 23:06:36,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:36,979 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-10-11 23:06:36,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 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 23:06:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-10-11 23:06:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-11 23:06:36,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:36,981 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 23:06:36,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 23:06:36,982 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 23:06:36,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:36,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1759811224, now seen corresponding path program 1 times [2024-10-11 23:06:36,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:36,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000246508] [2024-10-11 23:06:36,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:36,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:06:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:06:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:06:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,094 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 23:06:37,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:37,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000246508] [2024-10-11 23:06:37,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000246508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:37,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:37,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:37,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624006112] [2024-10-11 23:06:37,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:37,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:37,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:37,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:37,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:37,100 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 23:06:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:37,140 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2024-10-11 23:06:37,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:37,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 38 [2024-10-11 23:06:37,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:37,142 INFO L225 Difference]: With dead ends: 68 [2024-10-11 23:06:37,142 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 23:06:37,143 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 23:06:37,144 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:37,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 219 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 23:06:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-10-11 23:06:37,150 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 23:06:37,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2024-10-11 23:06:37,152 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 38 [2024-10-11 23:06:37,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:37,152 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2024-10-11 23:06:37,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 23:06:37,153 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2024-10-11 23:06:37,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 23:06:37,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:37,154 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 23:06:37,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 23:06:37,154 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 23:06:37,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:37,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1336940069, now seen corresponding path program 1 times [2024-10-11 23:06:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:37,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987714452] [2024-10-11 23:06:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:37,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:06:37,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:06:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:06:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 23:06:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 23:06:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,284 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 23:06:37,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:37,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987714452] [2024-10-11 23:06:37,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987714452] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:06:37,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128570601] [2024-10-11 23:06:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:37,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:06:37,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:06:37,293 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 23:06:37,294 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 23:06:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 23:06:37,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:06:37,442 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 23:06:37,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:06:37,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128570601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:37,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:06:37,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 23:06:37,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135347973] [2024-10-11 23:06:37,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:37,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:37,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:37,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:37,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:06:37,447 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 23:06:37,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:37,473 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2024-10-11 23:06:37,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:37,476 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 23:06:37,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:37,477 INFO L225 Difference]: With dead ends: 102 [2024-10-11 23:06:37,477 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 23:06:37,477 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 23:06:37,478 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 23:06:37,479 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 23:06:37,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 23:06:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-11 23:06:37,489 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 23:06:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2024-10-11 23:06:37,490 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 47 [2024-10-11 23:06:37,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:37,491 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2024-10-11 23:06:37,492 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 23:06:37,492 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2024-10-11 23:06:37,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 23:06:37,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:37,493 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 23:06:37,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 23:06:37,693 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 23:06:37,694 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 23:06:37,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:37,694 INFO L85 PathProgramCache]: Analyzing trace with hash 798701980, now seen corresponding path program 1 times [2024-10-11 23:06:37,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:37,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429064024] [2024-10-11 23:06:37,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:37,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:06:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:06:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:06:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 23:06:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:06:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:06:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,774 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 23:06:37,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:37,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429064024] [2024-10-11 23:06:37,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429064024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:37,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:37,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893830409] [2024-10-11 23:06:37,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:37,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:37,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:37,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:37,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:37,777 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 23:06:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:37,802 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2024-10-11 23:06:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:37,803 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 23:06:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:37,803 INFO L225 Difference]: With dead ends: 67 [2024-10-11 23:06:37,804 INFO L226 Difference]: Without dead ends: 66 [2024-10-11 23:06:37,804 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 23:06:37,805 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:37,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 212 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:37,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-11 23:06:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-10-11 23:06:37,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 45 states have internal predecessors, (53), 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 23:06:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2024-10-11 23:06:37,814 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 54 [2024-10-11 23:06:37,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:37,814 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2024-10-11 23:06:37,815 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 23:06:37,815 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2024-10-11 23:06:37,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-11 23:06:37,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:37,818 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, 1] [2024-10-11 23:06:37,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 23:06:37,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:06:37,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1010042268, now seen corresponding path program 1 times [2024-10-11 23:06:37,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:37,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490488362] [2024-10-11 23:06:37,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:37,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:06:37,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:06:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:06:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 23:06:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:06:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:06:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,905 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 23:06:37,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:37,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490488362] [2024-10-11 23:06:37,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490488362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:37,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:37,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:37,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202600670] [2024-10-11 23:06:37,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:37,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:37,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:37,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:37,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:37,909 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 23:06:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:37,938 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2024-10-11 23:06:37,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:37,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 55 [2024-10-11 23:06:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:37,940 INFO L225 Difference]: With dead ends: 72 [2024-10-11 23:06:37,940 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 23:06:37,940 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 23:06:37,940 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:37,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 222 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 23:06:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-10-11 23:06:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 49 states have internal predecessors, (58), 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 23:06:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 90 transitions. [2024-10-11 23:06:37,951 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 90 transitions. Word has length 55 [2024-10-11 23:06:37,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:37,952 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-10-11 23:06:37,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 23:06:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 90 transitions. [2024-10-11 23:06:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 23:06:37,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:37,953 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, 1] [2024-10-11 23:06:37,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 23:06:37,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:06:37,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:37,954 INFO L85 PathProgramCache]: Analyzing trace with hash 913339821, now seen corresponding path program 1 times [2024-10-11 23:06:37,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:37,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562967677] [2024-10-11 23:06:37,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:37,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:37,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:06:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:06:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:06:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 23:06:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:06:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:06:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 23:06:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,039 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 23:06:38,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:38,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562967677] [2024-10-11 23:06:38,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562967677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:38,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:38,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 23:06:38,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735434308] [2024-10-11 23:06:38,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:38,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:38,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:38,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:38,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:38,042 INFO L87 Difference]: Start difference. First operand 70 states and 90 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 23:06:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:38,060 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2024-10-11 23:06:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:38,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 61 [2024-10-11 23:06:38,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:38,061 INFO L225 Difference]: With dead ends: 91 [2024-10-11 23:06:38,061 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 23:06:38,062 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 23:06:38,062 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 23:06:38,062 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 23:06:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 23:06:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 23:06:38,067 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 23:06:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2024-10-11 23:06:38,067 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 61 [2024-10-11 23:06:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:38,068 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2024-10-11 23:06:38,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 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 23:06:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2024-10-11 23:06:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 23:06:38,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:38,073 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 23:06:38,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 23:06:38,073 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 23:06:38,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:38,074 INFO L85 PathProgramCache]: Analyzing trace with hash 611705301, now seen corresponding path program 1 times [2024-10-11 23:06:38,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:38,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920302427] [2024-10-11 23:06:38,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:38,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:06:38,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:06:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:06:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 23:06:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:06:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:06:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 23:06:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 23:06:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,160 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 23:06:38,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920302427] [2024-10-11 23:06:38,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920302427] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:06:38,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129147495] [2024-10-11 23:06:38,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:38,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:06:38,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:06:38,163 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 23:06:38,164 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 23:06:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 23:06:38,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:06:38,287 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 23:06:38,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:06:38,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129147495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:38,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:06:38,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 23:06:38,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63384232] [2024-10-11 23:06:38,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:38,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:38,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:38,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:38,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:06:38,292 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 23:06:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:38,318 INFO L93 Difference]: Finished difference Result 75 states and 92 transitions. [2024-10-11 23:06:38,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:38,319 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 23:06:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:38,320 INFO L225 Difference]: With dead ends: 75 [2024-10-11 23:06:38,320 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 23:06:38,321 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 23:06:38,321 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 23:06:38,321 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 23:06:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 23:06:38,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 23:06:38,333 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 23:06:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2024-10-11 23:06:38,334 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 65 [2024-10-11 23:06:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:38,334 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2024-10-11 23:06:38,334 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 23:06:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2024-10-11 23:06:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 23:06:38,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:38,336 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 23:06:38,355 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 23:06:38,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:06:38,540 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 23:06:38,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:38,540 INFO L85 PathProgramCache]: Analyzing trace with hash -812326662, now seen corresponding path program 1 times [2024-10-11 23:06:38,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:38,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488832820] [2024-10-11 23:06:38,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:38,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:38,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:06:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:06:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:06:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 23:06:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:06:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:06:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 23:06:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:06:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 23:06:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,673 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 23:06:38,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:38,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488832820] [2024-10-11 23:06:38,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488832820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:38,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:38,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:38,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517520786] [2024-10-11 23:06:38,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:38,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:38,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:38,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:38,676 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 23:06:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:38,697 INFO L93 Difference]: Finished difference Result 62 states and 77 transitions. [2024-10-11 23:06:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:38,697 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 23:06:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:38,698 INFO L225 Difference]: With dead ends: 62 [2024-10-11 23:06:38,698 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 23:06:38,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 23:06:38,699 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 3 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:38,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:38,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 23:06:38,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 23:06:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 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 23:06:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2024-10-11 23:06:38,704 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 71 [2024-10-11 23:06:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:38,704 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2024-10-11 23:06:38,705 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 23:06:38,705 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2024-10-11 23:06:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 23:06:38,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:38,706 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, 1] [2024-10-11 23:06:38,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 23:06:38,706 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:06:38,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:38,707 INFO L85 PathProgramCache]: Analyzing trace with hash 587677405, now seen corresponding path program 1 times [2024-10-11 23:06:38,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:38,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265015722] [2024-10-11 23:06:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:06:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:06:38,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:06:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 23:06:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:06:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:06:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 23:06:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:06:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 23:06:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,814 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 23:06:38,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:38,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265015722] [2024-10-11 23:06:38,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265015722] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:38,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 23:06:38,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 23:06:38,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049091287] [2024-10-11 23:06:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:38,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:38,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:38,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 23:06:38,817 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 23:06:38,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:38,842 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2024-10-11 23:06:38,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:38,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 72 [2024-10-11 23:06:38,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:38,844 INFO L225 Difference]: With dead ends: 67 [2024-10-11 23:06:38,845 INFO L226 Difference]: Without dead ends: 61 [2024-10-11 23:06:38,845 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 23:06:38,846 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 23:06:38,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 23:06:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-11 23:06:38,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-11 23:06:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 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 23:06:38,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2024-10-11 23:06:38,853 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 72 [2024-10-11 23:06:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:38,855 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2024-10-11 23:06:38,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.333333333333334) internal successors, (40), 4 states have internal predecessors, (40), 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 23:06:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2024-10-11 23:06:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 23:06:38,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 23:06:38,857 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, 1] [2024-10-11 23:06:38,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 23:06:38,857 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2024-10-11 23:06:38,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 23:06:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash -221669221, now seen corresponding path program 1 times [2024-10-11 23:06:38,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 23:06:38,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727746132] [2024-10-11 23:06:38,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:38,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 23:06:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 23:06:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 23:06:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 23:06:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 23:06:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 23:06:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 23:06:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 23:06:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 23:06:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 23:06:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 23:06:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 23:06:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 23:06:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:38,962 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 23:06:38,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 23:06:38,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727746132] [2024-10-11 23:06:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727746132] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 23:06:38,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058916773] [2024-10-11 23:06:38,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 23:06:38,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:06:38,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 23:06:38,965 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 23:06:38,967 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 23:06:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 23:06:39,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 23:06:39,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 23:06:39,090 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 23:06:39,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 23:06:39,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058916773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 23:06:39,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 23:06:39,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-11 23:06:39,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53965832] [2024-10-11 23:06:39,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 23:06:39,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 23:06:39,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 23:06:39,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 23:06:39,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 23:06:39,095 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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 23:06:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 23:06:39,120 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2024-10-11 23:06:39,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 23:06:39,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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 72 [2024-10-11 23:06:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 23:06:39,121 INFO L225 Difference]: With dead ends: 63 [2024-10-11 23:06:39,122 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 23:06:39,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 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 23:06:39,123 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 23:06:39,123 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 23:06:39,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 23:06:39,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 23:06:39,123 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 23:06:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 23:06:39,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-10-11 23:06:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 23:06:39,124 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 23:06:39,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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 23:06:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 23:06:39,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 23:06:39,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2024-10-11 23:06:39,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2024-10-11 23:06:39,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2024-10-11 23:06:39,130 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2024-10-11 23:06:39,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2024-10-11 23:06:39,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2024-10-11 23:06:39,131 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2024-10-11 23:06:39,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2024-10-11 23:06:39,149 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 23:06:39,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 23:06:39,335 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 23:06:39,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 23:06:39,380 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 23:06:39,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:06:39 BoogieIcfgContainer [2024-10-11 23:06:39,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 23:06:39,398 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 23:06:39,398 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 23:06:39,398 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 23:06:39,399 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:06:35" (3/4) ... [2024-10-11 23:06:39,401 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 23:06:39,404 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2024-10-11 23:06:39,405 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsFalse [2024-10-11 23:06:39,405 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2024-10-11 23:06:39,405 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure staticReturnsTrue [2024-10-11 23:06:39,412 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-11 23:06:39,413 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 23:06:39,413 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 23:06:39,413 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 23:06:39,525 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 23:06:39,526 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 23:06:39,526 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 23:06:39,527 INFO L158 Benchmark]: Toolchain (without parser) took 5955.49ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 81.4MB in the beginning and 64.2MB in the end (delta: 17.2MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2024-10-11 23:06:39,527 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 23:06:39,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1180.76ms. Allocated memory is still 161.5MB. Free memory was 81.2MB in the beginning and 75.1MB in the end (delta: 6.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-10-11 23:06:39,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.45ms. Allocated memory is still 161.5MB. Free memory was 75.1MB in the beginning and 71.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 23:06:39,527 INFO L158 Benchmark]: Boogie Preprocessor took 62.06ms. Allocated memory is still 161.5MB. Free memory was 71.9MB in the beginning and 69.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 23:06:39,528 INFO L158 Benchmark]: RCFGBuilder took 579.18ms. Allocated memory is still 161.5MB. Free memory was 69.8MB in the beginning and 111.2MB in the end (delta: -41.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 23:06:39,528 INFO L158 Benchmark]: TraceAbstraction took 3913.89ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 110.1MB in the beginning and 71.5MB in the end (delta: 38.6MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. [2024-10-11 23:06:39,528 INFO L158 Benchmark]: Witness Printer took 128.13ms. Allocated memory is still 201.3MB. Free memory was 71.5MB in the beginning and 64.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 23:06:39,529 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.21ms. Allocated memory is still 161.5MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1180.76ms. Allocated memory is still 161.5MB. Free memory was 81.2MB in the beginning and 75.1MB in the end (delta: 6.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.45ms. Allocated memory is still 161.5MB. Free memory was 75.1MB in the beginning and 71.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.06ms. Allocated memory is still 161.5MB. Free memory was 71.9MB in the beginning and 69.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 579.18ms. Allocated memory is still 161.5MB. Free memory was 69.8MB in the beginning and 111.2MB in the end (delta: -41.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3913.89ms. Allocated memory was 161.5MB in the beginning and 201.3MB in the end (delta: 39.8MB). Free memory was 110.1MB in the beginning and 71.5MB in the end (delta: 38.6MB). Peak memory consumption was 80.5MB. Max. memory is 16.1GB. * Witness Printer took 128.13ms. Allocated memory is still 201.3MB. Free memory was 71.5MB in the beginning and 64.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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.8s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 2718 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1727 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 265 IncrementalHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 991 mSDtfsCounter, 265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 432 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 50, 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, 13 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 831 NumberOfCodeBlocks, 831 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 967 SizeOfPredicates, 0 NumberOfNonLiveVariables, 598 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 318/322 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 23:06:39,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE