./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/modulus-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/bitvector/modulus-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-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 32bit --witnessprinter.graph.data.programhash 53bf165bfbef55aa8ab289084a5d3d80b8d81c13dbafd349815c35b63fd8829c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:10:24,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:10:24,182 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-10-11 20:10:24,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:10:24,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:10:24,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:10:24,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:10:24,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:10:24,212 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:10:24,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:10:24,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:10:24,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:10:24,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:10:24,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:10:24,215 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:10:24,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:10:24,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:10:24,218 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:10:24,218 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 20:10:24,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:10:24,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:10:24,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:10:24,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:10:24,219 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:10:24,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:10:24,219 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:10:24,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:10:24,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:10:24,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:10:24,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:10:24,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:10:24,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:10:24,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:10:24,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:10:24,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:10:24,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:10:24,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:10:24,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:10:24,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 20:10:24,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 20:10:24,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:10:24,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:10:24,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:10:24,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:10:24,226 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53bf165bfbef55aa8ab289084a5d3d80b8d81c13dbafd349815c35b63fd8829c [2024-10-11 20:10:24,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:10:24,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:10:24,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:10:24,421 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:10:24,422 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:10:24,423 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/modulus-1.i [2024-10-11 20:10:25,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:10:25,874 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:10:25,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/modulus-1.i [2024-10-11 20:10:25,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6bb19e2f8/dfeebec426294f76ad0947fc25e87c25/FLAGa9d0837aa [2024-10-11 20:10:26,276 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6bb19e2f8/dfeebec426294f76ad0947fc25e87c25 [2024-10-11 20:10:26,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:10:26,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:10:26,283 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:10:26,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:10:26,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:10:26,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a57af4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26, skipping insertion in model container [2024-10-11 20:10:26,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:10:26,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:10:26,451 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:10:26,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:10:26,477 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:10:26,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26 WrapperNode [2024-10-11 20:10:26,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:10:26,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:10:26,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:10:26,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:10:26,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,523 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 73 [2024-10-11 20:10:26,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:10:26,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:10:26,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:10:26,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:10:26,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,555 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:10:26,556 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,556 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,559 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:10:26,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:10:26,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:10:26,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:10:26,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (1/1) ... [2024-10-11 20:10:26,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:10:26,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:26,601 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 20:10:26,603 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 20:10:26,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:10:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 20:10:26,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:10:26,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:10:26,698 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:10:26,700 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:10:26,869 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 20:10:26,869 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:10:26,902 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:10:26,904 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:10:26,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:26 BoogieIcfgContainer [2024-10-11 20:10:26,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:10:26,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:10:26,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:10:26,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:10:26,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:10:26" (1/3) ... [2024-10-11 20:10:26,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa0c924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:10:26, skipping insertion in model container [2024-10-11 20:10:26,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:26" (2/3) ... [2024-10-11 20:10:26,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa0c924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:10:26, skipping insertion in model container [2024-10-11 20:10:26,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:26" (3/3) ... [2024-10-11 20:10:26,912 INFO L112 eAbstractionObserver]: Analyzing ICFG modulus-1.i [2024-10-11 20:10:26,927 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:10:26,927 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-11 20:10:26,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:10:26,988 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;@256a9e6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:10:26,988 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 20:10:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 33 states have internal predecessors, (46), 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 20:10:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:10:26,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:26,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:10:26,999 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-11 20:10:27,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash 4146043, now seen corresponding path program 1 times [2024-10-11 20:10:27,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:27,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774706996] [2024-10-11 20:10:27,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:27,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:27,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:27,131 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 20:10:27,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:27,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774706996] [2024-10-11 20:10:27,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774706996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:27,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:27,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:10:27,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378051731] [2024-10-11 20:10:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:27,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:10:27,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:27,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:10:27,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:10:27,164 INFO L87 Difference]: Start difference. First operand has 34 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:27,187 INFO L93 Difference]: Finished difference Result 65 states and 88 transitions. [2024-10-11 20:10:27,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:10:27,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:10:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:27,200 INFO L225 Difference]: With dead ends: 65 [2024-10-11 20:10:27,201 INFO L226 Difference]: Without dead ends: 15 [2024-10-11 20:10:27,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:10:27,207 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:27,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-11 20:10:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-11 20:10:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.5) internal successors, (15), 14 states have internal predecessors, (15), 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 20:10:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-10-11 20:10:27,291 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 4 [2024-10-11 20:10:27,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:27,293 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-10-11 20:10:27,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-10-11 20:10:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:10:27,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:27,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:10:27,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 20:10:27,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-11 20:10:27,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:27,301 INFO L85 PathProgramCache]: Analyzing trace with hash 4147965, now seen corresponding path program 1 times [2024-10-11 20:10:27,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:27,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188242668] [2024-10-11 20:10:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:27,519 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 20:10:27,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:27,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188242668] [2024-10-11 20:10:27,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188242668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:27,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:27,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:10:27,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835598025] [2024-10-11 20:10:27,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:27,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:27,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:27,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:10:27,522 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:27,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:27,542 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-10-11 20:10:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:10:27,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:10:27,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:27,543 INFO L225 Difference]: With dead ends: 15 [2024-10-11 20:10:27,543 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 20:10:27,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:10:27,544 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:27,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 9 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:27,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 20:10:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 20:10:27,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.4) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-11 20:10:27,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 4 [2024-10-11 20:10:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:27,547 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-11 20:10:27,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-11 20:10:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:10:27,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:27,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:10:27,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 20:10:27,548 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-11 20:10:27,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:27,549 INFO L85 PathProgramCache]: Analyzing trace with hash -308771517, now seen corresponding path program 1 times [2024-10-11 20:10:27,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:27,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542433918] [2024-10-11 20:10:27,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:27,585 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 20:10:27,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:27,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542433918] [2024-10-11 20:10:27,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542433918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:27,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:27,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:10:27,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538504331] [2024-10-11 20:10:27,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:27,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:10:27,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:27,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:10:27,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:27,589 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 20:10:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:27,607 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2024-10-11 20:10:27,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:10:27,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-11 20:10:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:27,608 INFO L225 Difference]: With dead ends: 22 [2024-10-11 20:10:27,608 INFO L226 Difference]: Without dead ends: 14 [2024-10-11 20:10:27,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:10:27,609 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:27,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:27,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2024-10-11 20:10:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-11 20:10:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2024-10-11 20:10:27,615 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 6 [2024-10-11 20:10:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:27,615 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2024-10-11 20:10:27,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 20:10:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2024-10-11 20:10:27,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 20:10:27,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:27,616 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:27,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 20:10:27,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-11 20:10:27,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:27,617 INFO L85 PathProgramCache]: Analyzing trace with hash -981980556, now seen corresponding path program 1 times [2024-10-11 20:10:27,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:27,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811528476] [2024-10-11 20:10:27,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:27,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:27,656 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 20:10:27,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 20:10:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811528476] [2024-10-11 20:10:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811528476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:27,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:27,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:10:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238988831] [2024-10-11 20:10:27,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:27,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 20:10:27,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 20:10:27,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 20:10:27,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 20:10:27,660 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:27,679 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2024-10-11 20:10:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 20:10:27,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 20:10:27,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:27,680 INFO L225 Difference]: With dead ends: 14 [2024-10-11 20:10:27,680 INFO L226 Difference]: Without dead ends: 12 [2024-10-11 20:10:27,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:10:27,681 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:27,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 9 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:27,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-11 20:10:27,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-10-11 20:10:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 11 transitions. [2024-10-11 20:10:27,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 11 transitions. Word has length 7 [2024-10-11 20:10:27,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:27,686 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 11 transitions. [2024-10-11 20:10:27,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:27,687 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 11 transitions. [2024-10-11 20:10:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 20:10:27,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:27,687 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 20:10:27,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 20:10:27,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-11 20:10:27,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:27,688 INFO L85 PathProgramCache]: Analyzing trace with hash -376626112, now seen corresponding path program 1 times [2024-10-11 20:10:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 20:10:27,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065114289] [2024-10-11 20:10:27,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:27,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 20:10:27,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:10:27,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 20:10:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:10:27,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 20:10:27,725 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 20:10:27,725 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 5 remaining) [2024-10-11 20:10:27,727 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2024-10-11 20:10:27,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2024-10-11 20:10:27,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2024-10-11 20:10:27,729 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 5 remaining) [2024-10-11 20:10:27,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 20:10:27,732 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 20:10:27,744 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:10:27,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:10:27 BoogieIcfgContainer [2024-10-11 20:10:27,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:10:27,747 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:10:27,747 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:10:27,747 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:10:27,748 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:26" (3/4) ... [2024-10-11 20:10:27,750 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 20:10:27,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:10:27,751 INFO L158 Benchmark]: Toolchain (without parser) took 1469.69ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 82.1MB in the beginning and 131.0MB in the end (delta: -49.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:27,751 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 155.2MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:27,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.20ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 69.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:10:27,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.83ms. Allocated memory is still 155.2MB. Free memory was 69.7MB in the beginning and 124.9MB in the end (delta: -55.2MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-10-11 20:10:27,752 INFO L158 Benchmark]: Boogie Preprocessor took 41.03ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 124.8MB in the beginning and 165.2MB in the end (delta: -40.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:10:27,753 INFO L158 Benchmark]: RCFGBuilder took 336.84ms. Allocated memory is still 192.9MB. Free memory was 165.2MB in the beginning and 150.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 20:10:27,753 INFO L158 Benchmark]: TraceAbstraction took 840.19ms. Allocated memory is still 192.9MB. Free memory was 149.5MB in the beginning and 131.0MB in the end (delta: 18.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-10-11 20:10:27,753 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 192.9MB. Free memory is still 131.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:27,755 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.74ms. Allocated memory is still 155.2MB. Free memory is still 106.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.20ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 69.7MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.83ms. Allocated memory is still 155.2MB. Free memory was 69.7MB in the beginning and 124.9MB in the end (delta: -55.2MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.03ms. Allocated memory was 155.2MB in the beginning and 192.9MB in the end (delta: 37.7MB). Free memory was 124.8MB in the beginning and 165.2MB in the end (delta: -40.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 336.84ms. Allocated memory is still 192.9MB. Free memory was 165.2MB in the beginning and 150.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 840.19ms. Allocated memory is still 192.9MB. Free memory was 149.5MB in the beginning and 131.0MB in the end (delta: 18.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 192.9MB. Free memory is still 131.0MB. There was no memory consumed. 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 - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of shiftLeft at line 51. Possible FailurePath: [L46] unsigned int n = __VERIFIER_nondet_uint(); [L47] unsigned int s = __VERIFIER_nondet_uint(); [L48] unsigned int d; [L49] unsigned int m; [L50] CALL assume_abort_if_not(s < 32) [L11] COND FALSE !(!cond) [L50] RET assume_abort_if_not(s < 32) [L51] 1 << s VAL [s=1] - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 61 mSDtfsCounter, 31 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 12, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 20:10:27,779 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/modulus-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.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 32bit --witnessprinter.graph.data.programhash 53bf165bfbef55aa8ab289084a5d3d80b8d81c13dbafd349815c35b63fd8829c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 20:10:29,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 20:10:29,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2024-10-11 20:10:29,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 20:10:29,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 20:10:29,851 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 20:10:29,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 20:10:29,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 20:10:29,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 20:10:29,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 20:10:29,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 20:10:29,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 20:10:29,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 20:10:29,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 20:10:29,857 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 20:10:29,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 20:10:29,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 20:10:29,858 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 20:10:29,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 20:10:29,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 20:10:29,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 20:10:29,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 20:10:29,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 20:10:29,864 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 20:10:29,864 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 20:10:29,865 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 20:10:29,865 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 20:10:29,865 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 20:10:29,866 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 20:10:29,866 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 20:10:29,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 20:10:29,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 20:10:29,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 20:10:29,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 20:10:29,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 20:10:29,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 20:10:29,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:10:29,869 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 20:10:29,869 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 20:10:29,869 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 20:10:29,869 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 20:10:29,869 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 20:10:29,870 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 20:10:29,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 20:10:29,870 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 20:10:29,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 20:10:29,871 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 20:10:29,871 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 53bf165bfbef55aa8ab289084a5d3d80b8d81c13dbafd349815c35b63fd8829c [2024-10-11 20:10:30,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 20:10:30,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 20:10:30,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 20:10:30,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 20:10:30,151 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 20:10:30,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/modulus-1.i [2024-10-11 20:10:31,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 20:10:31,753 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 20:10:31,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/modulus-1.i [2024-10-11 20:10:31,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/515b02c78/936860b1637c45d5960e5528dd5aca28/FLAG89546f020 [2024-10-11 20:10:32,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/515b02c78/936860b1637c45d5960e5528dd5aca28 [2024-10-11 20:10:32,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 20:10:32,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 20:10:32,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 20:10:32,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 20:10:32,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 20:10:32,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620c7429 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32, skipping insertion in model container [2024-10-11 20:10:32,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 20:10:32,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:10:32,348 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 20:10:32,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 20:10:32,402 INFO L204 MainTranslator]: Completed translation [2024-10-11 20:10:32,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32 WrapperNode [2024-10-11 20:10:32,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 20:10:32,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 20:10:32,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 20:10:32,404 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 20:10:32,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,433 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 53 [2024-10-11 20:10:32,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 20:10:32,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 20:10:32,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 20:10:32,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 20:10:32,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,450 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,466 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 20:10:32,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 20:10:32,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 20:10:32,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 20:10:32,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 20:10:32,495 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (1/1) ... [2024-10-11 20:10:32,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 20:10:32,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 20:10:32,520 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 20:10:32,523 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 20:10:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 20:10:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 20:10:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 20:10:32,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 20:10:32,608 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 20:10:32,609 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 20:10:32,799 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 20:10:32,799 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 20:10:32,831 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 20:10:32,831 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 20:10:32,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:32 BoogieIcfgContainer [2024-10-11 20:10:32,832 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 20:10:32,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 20:10:32,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 20:10:32,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 20:10:32,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:10:32" (1/3) ... [2024-10-11 20:10:32,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d1fef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:10:32, skipping insertion in model container [2024-10-11 20:10:32,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:10:32" (2/3) ... [2024-10-11 20:10:32,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d1fef0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:10:32, skipping insertion in model container [2024-10-11 20:10:32,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:32" (3/3) ... [2024-10-11 20:10:32,840 INFO L112 eAbstractionObserver]: Analyzing ICFG modulus-1.i [2024-10-11 20:10:32,854 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 20:10:32,855 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-10-11 20:10:32,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 20:10:32,920 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;@30e52488, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 20:10:32,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 20:10:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.736842105263158) internal successors, (33), 24 states have internal predecessors, (33), 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 20:10:32,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:10:32,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:32,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:10:32,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-11 20:10:32,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:32,937 INFO L85 PathProgramCache]: Analyzing trace with hash 3311895, now seen corresponding path program 1 times [2024-10-11 20:10:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:10:32,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968946792] [2024-10-11 20:10:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:32,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:32,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:10:32,950 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 20:10:32,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 20:10:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:32,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 20:10:33,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:33,016 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 20:10:33,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:10:33,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:10:33,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968946792] [2024-10-11 20:10:33,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968946792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:33,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:33,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:10:33,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044533062] [2024-10-11 20:10:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:33,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 20:10:33,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:10:33,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 20:10:33,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:10:33,047 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.736842105263158) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:33,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:33,067 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2024-10-11 20:10:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 20:10:33,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:10:33,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:33,075 INFO L225 Difference]: With dead ends: 46 [2024-10-11 20:10:33,076 INFO L226 Difference]: Without dead ends: 11 [2024-10-11 20:10:33,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 20:10:33,082 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:33,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:33,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-11 20:10:33,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-11 20:10:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 10 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 10 transitions. [2024-10-11 20:10:33,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 10 transitions. Word has length 4 [2024-10-11 20:10:33,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:33,105 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 10 transitions. [2024-10-11 20:10:33,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:33,106 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 10 transitions. [2024-10-11 20:10:33,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 20:10:33,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:33,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 20:10:33,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 20:10:33,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:33,307 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-11 20:10:33,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 3313817, now seen corresponding path program 1 times [2024-10-11 20:10:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:10:33,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569876408] [2024-10-11 20:10:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:33,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:33,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:10:33,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 20:10:33,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 20:10:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 20:10:33,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 20:10:33,420 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 20:10:33,509 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 20:10:33,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 20:10:33,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 20:10:33,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569876408] [2024-10-11 20:10:33,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569876408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 20:10:33,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 20:10:33,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 20:10:33,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880657255] [2024-10-11 20:10:33,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 20:10:33,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 20:10:33,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 20:10:33,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 20:10:33,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 20:10:33,512 INFO L87 Difference]: Start difference. First operand 11 states and 10 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:33,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 20:10:33,540 INFO L93 Difference]: Finished difference Result 11 states and 10 transitions. [2024-10-11 20:10:33,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 20:10:33,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 20:10:33,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 20:10:33,543 INFO L225 Difference]: With dead ends: 11 [2024-10-11 20:10:33,543 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 20:10:33,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 20:10:33,545 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 3 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 20:10:33,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 20:10:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 20:10:33,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-10-11 20:10:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 8 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8 transitions. [2024-10-11 20:10:33,549 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 8 transitions. Word has length 4 [2024-10-11 20:10:33,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 20:10:33,549 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 8 transitions. [2024-10-11 20:10:33,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 20:10:33,549 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2024-10-11 20:10:33,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 20:10:33,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 20:10:33,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 20:10:33,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 20:10:33,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:33,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2024-10-11 20:10:33,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 20:10:33,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1110387781, now seen corresponding path program 1 times [2024-10-11 20:10:33,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 20:10:33,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797461556] [2024-10-11 20:10:33,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 20:10:33,754 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:33,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 20:10:33,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 20:10:33,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 20:10:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:10:33,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 20:10:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 20:10:33,812 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 20:10:33,813 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 20:10:33,814 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 5 remaining) [2024-10-11 20:10:33,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 5 remaining) [2024-10-11 20:10:33,818 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 5 remaining) [2024-10-11 20:10:33,819 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 5 remaining) [2024-10-11 20:10:33,820 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 5 remaining) [2024-10-11 20:10:33,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 20:10:34,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 20:10:34,024 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 20:10:34,033 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 20:10:34,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:10:34 BoogieIcfgContainer [2024-10-11 20:10:34,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 20:10:34,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 20:10:34,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 20:10:34,036 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 20:10:34,037 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:10:32" (3/4) ... [2024-10-11 20:10:34,037 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 20:10:34,061 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 20:10:34,061 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 20:10:34,061 INFO L158 Benchmark]: Toolchain (without parser) took 1908.26ms. Allocated memory is still 83.9MB. Free memory was 53.7MB in the beginning and 46.7MB in the end (delta: 7.0MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-10-11 20:10:34,062 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 58.7MB. Free memory was 39.3MB in the beginning and 39.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:34,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.10ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 62.8MB in the end (delta: -9.2MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-10-11 20:10:34,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.28ms. Allocated memory is still 83.9MB. Free memory was 62.8MB in the beginning and 61.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:10:34,063 INFO L158 Benchmark]: Boogie Preprocessor took 54.23ms. Allocated memory is still 83.9MB. Free memory was 61.2MB in the beginning and 59.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:10:34,063 INFO L158 Benchmark]: RCFGBuilder took 337.36ms. Allocated memory is still 83.9MB. Free memory was 59.1MB in the beginning and 46.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 20:10:34,063 INFO L158 Benchmark]: TraceAbstraction took 1201.67ms. Allocated memory is still 83.9MB. Free memory was 46.1MB in the beginning and 48.3MB in the end (delta: -2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 20:10:34,064 INFO L158 Benchmark]: Witness Printer took 25.07ms. Allocated memory is still 83.9MB. Free memory was 48.3MB in the beginning and 46.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 20:10:34,065 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.09ms. Allocated memory is still 58.7MB. Free memory was 39.3MB in the beginning and 39.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.10ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 62.8MB in the end (delta: -9.2MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.28ms. Allocated memory is still 83.9MB. Free memory was 62.8MB in the beginning and 61.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.23ms. Allocated memory is still 83.9MB. Free memory was 61.2MB in the beginning and 59.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 337.36ms. Allocated memory is still 83.9MB. Free memory was 59.1MB in the beginning and 46.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1201.67ms. Allocated memory is still 83.9MB. Free memory was 46.1MB in the beginning and 48.3MB in the end (delta: -2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 25.07ms. Allocated memory is still 83.9MB. Free memory was 48.3MB in the beginning and 46.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 51]: integer overflow possible integer overflow possible We found a FailurePath: [L46] unsigned int n = __VERIFIER_nondet_uint(); [L47] unsigned int s = __VERIFIER_nondet_uint(); [L48] unsigned int d; [L49] unsigned int m; [L50] CALL assume_abort_if_not(s < 32) [L11] COND FALSE !(!cond) [L50] RET assume_abort_if_not(s < 32) [L51] 1 << s - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 51]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 24 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 28 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 20:10:34,092 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)