./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ae4314f4ba811ecc81374bb4df27f78b66c4c1beea0be05c76985457c985743 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:10:57,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:10:57,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:10:57,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:10:57,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:10:57,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:10:57,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:10:57,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:10:57,580 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:10:57,582 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:10:57,582 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:10:57,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:10:57,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:10:57,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:10:57,585 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:10:57,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:10:57,586 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:10:57,586 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:10:57,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:10:57,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:10:57,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:10:57,592 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:10:57,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:10:57,592 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:10:57,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:10:57,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:10:57,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:10:57,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:10:57,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:10:57,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:10:57,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:10:57,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:10:57,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:10:57,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:10:57,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:10:57,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:10:57,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:10:57,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:10:57,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:10:57,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:10:57,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:10:57,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:10:57,600 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/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 ! call(reach_error())) ) 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 -> 6ae4314f4ba811ecc81374bb4df27f78b66c4c1beea0be05c76985457c985743 [2024-10-14 12:10:57,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:10:57,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:10:57,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:10:57,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:10:57,933 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:10:57,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-68.i [2024-10-14 12:10:59,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:10:59,950 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:10:59,951 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-68.i [2024-10-14 12:10:59,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2db9aebde/ba7c11eb637245a1b8f7a4a1e4e6e6b8/FLAG19e13e433 [2024-10-14 12:10:59,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2db9aebde/ba7c11eb637245a1b8f7a4a1e4e6e6b8 [2024-10-14 12:10:59,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:10:59,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:10:59,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:10:59,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:10:59,993 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:10:59,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:10:59" (1/1) ... [2024-10-14 12:10:59,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18318c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:10:59, skipping insertion in model container [2024-10-14 12:10:59,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:10:59" (1/1) ... [2024-10-14 12:11:00,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:11:00,231 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-68.i[915,928] [2024-10-14 12:11:00,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:11:00,334 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:11:00,351 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-68.i[915,928] [2024-10-14 12:11:00,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:11:00,398 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:11:00,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00 WrapperNode [2024-10-14 12:11:00,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:11:00,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:11:00,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:11:00,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:11:00,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,425 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,512 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-10-14 12:11:00,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:11:00,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:11:00,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:11:00,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:11:00,570 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,604 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-14 12:11:00,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,613 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,632 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:11:00,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:11:00,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:11:00,646 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:11:00,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (1/1) ... [2024-10-14 12:11:00,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:11:00,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:11:00,697 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:11:00,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:11:00,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:11:00,756 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:11:00,757 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:11:00,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:11:00,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:11:00,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:11:00,846 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:11:00,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:11:01,261 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-14 12:11:01,262 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:11:01,298 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:11:01,298 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:11:01,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:11:01 BoogieIcfgContainer [2024-10-14 12:11:01,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:11:01,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:11:01,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:11:01,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:11:01,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:10:59" (1/3) ... [2024-10-14 12:11:01,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b91209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:11:01, skipping insertion in model container [2024-10-14 12:11:01,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:00" (2/3) ... [2024-10-14 12:11:01,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b91209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:11:01, skipping insertion in model container [2024-10-14 12:11:01,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:11:01" (3/3) ... [2024-10-14 12:11:01,309 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-68.i [2024-10-14 12:11:01,326 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:11:01,327 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:11:01,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:11:01,407 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;@5b28e14d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:11:01,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:11:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 40 states have internal predecessors, (60), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 12:11:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 12:11:01,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:11:01,424 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:11:01,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:11:01,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:11:01,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1850628642, now seen corresponding path program 1 times [2024-10-14 12:11:01,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:11:01,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620967470] [2024-10-14 12:11:01,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:11:01,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:11:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:01,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:11:01,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:01,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:11:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:01,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:11:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:01,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:11:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:11:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:01,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:11:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:01,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:11:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:11:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:01,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:11:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:01,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:11:01,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 12:11:01,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:11:01,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620967470] [2024-10-14 12:11:01,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620967470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:11:01,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:11:01,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:11:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887716744] [2024-10-14 12:11:01,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:11:01,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:11:01,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:11:01,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:11:01,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:11:01,889 INFO L87 Difference]: Start difference. First operand has 52 states, 39 states have (on average 1.5384615384615385) internal successors, (60), 40 states have internal predecessors, (60), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 12:11:01,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:11:01,949 INFO L93 Difference]: Finished difference Result 99 states and 166 transitions. [2024-10-14 12:11:01,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:11:01,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 74 [2024-10-14 12:11:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:11:01,964 INFO L225 Difference]: With dead ends: 99 [2024-10-14 12:11:01,964 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 12:11:01,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 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-14 12:11:01,980 INFO L432 NwaCegarLoop]: 68 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, 68 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-14 12:11:01,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:11:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 12:11:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 12:11:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 12:11:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-14 12:11:02,071 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 74 [2024-10-14 12:11:02,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:11:02,076 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-14 12:11:02,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 12:11:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-14 12:11:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 12:11:02,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:11:02,086 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:11:02,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:11:02,087 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:11:02,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:11:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash 580278618, now seen corresponding path program 1 times [2024-10-14 12:11:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:11:02,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979907582] [2024-10-14 12:11:02,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:11:02,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:11:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:02,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:11:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:11:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:02,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:11:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:02,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:11:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:02,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:11:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:02,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:11:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:02,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:11:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:02,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:11:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:02,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:11:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:02,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:11:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:02,450 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 12:11:02,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:11:02,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979907582] [2024-10-14 12:11:02,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979907582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:11:02,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:11:02,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:11:02,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166472349] [2024-10-14 12:11:02,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:11:02,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:11:02,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:11:02,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:11:02,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:11:02,460 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:11:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:11:02,575 INFO L93 Difference]: Finished difference Result 95 states and 141 transitions. [2024-10-14 12:11:02,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:11:02,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 74 [2024-10-14 12:11:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:11:02,578 INFO L225 Difference]: With dead ends: 95 [2024-10-14 12:11:02,578 INFO L226 Difference]: Without dead ends: 48 [2024-10-14 12:11:02,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-14 12:11:02,580 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 63 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:11:02,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 95 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:11:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-14 12:11:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-14 12:11:02,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 12:11:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2024-10-14 12:11:02,589 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 74 [2024-10-14 12:11:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:11:02,590 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2024-10-14 12:11:02,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:11:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2024-10-14 12:11:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 12:11:02,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:11:02,593 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:11:02,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:11:02,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:11:02,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:11:02,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1867171113, now seen corresponding path program 1 times [2024-10-14 12:11:02,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:11:02,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146303] [2024-10-14 12:11:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:11:02,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:11:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:11:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:11:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:03,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:11:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:11:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:03,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:11:03,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:03,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:11:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:11:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:03,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:11:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:03,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:11:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:03,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:11:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 12:11:03,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:11:03,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146303] [2024-10-14 12:11:03,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:11:03,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:11:03,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 12:11:03,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790694335] [2024-10-14 12:11:03,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:11:03,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 12:11:03,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:11:03,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 12:11:03,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:11:03,723 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:11:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:11:04,399 INFO L93 Difference]: Finished difference Result 210 states and 300 transitions. [2024-10-14 12:11:04,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 12:11:04,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2024-10-14 12:11:04,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:11:04,403 INFO L225 Difference]: With dead ends: 210 [2024-10-14 12:11:04,403 INFO L226 Difference]: Without dead ends: 163 [2024-10-14 12:11:04,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-14 12:11:04,405 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 196 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:11:04,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 358 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:11:04,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-14 12:11:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 112. [2024-10-14 12:11:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 80 states have internal predecessors, (102), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 12:11:04,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-10-14 12:11:04,434 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 75 [2024-10-14 12:11:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:11:04,435 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-10-14 12:11:04,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:11:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-10-14 12:11:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 12:11:04,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:11:04,437 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:11:04,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:11:04,437 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:11:04,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:11:04,438 INFO L85 PathProgramCache]: Analyzing trace with hash 147191713, now seen corresponding path program 1 times [2024-10-14 12:11:04,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:11:04,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422320965] [2024-10-14 12:11:04,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:11:04,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:11:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:04,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:11:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:04,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:11:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:04,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:11:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:04,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:11:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:04,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:11:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:04,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:11:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:04,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:11:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:04,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:11:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:04,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:11:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:11:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 12:11:04,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:11:04,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422320965] [2024-10-14 12:11:04,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422320965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:11:04,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:11:04,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 12:11:04,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559091833] [2024-10-14 12:11:04,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:11:04,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 12:11:04,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:11:04,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 12:11:04,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:11:04,874 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:11:05,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:11:05,266 INFO L93 Difference]: Finished difference Result 229 states and 324 transitions. [2024-10-14 12:11:05,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 12:11:05,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 76 [2024-10-14 12:11:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:11:05,275 INFO L225 Difference]: With dead ends: 229 [2024-10-14 12:11:05,275 INFO L226 Difference]: Without dead ends: 182 [2024-10-14 12:11:05,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-14 12:11:05,277 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 191 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:11:05,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 332 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 12:11:05,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-14 12:11:05,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2024-10-14 12:11:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.2947368421052632) internal successors, (123), 96 states have internal predecessors, (123), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 12:11:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 179 transitions. [2024-10-14 12:11:05,301 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 179 transitions. Word has length 76 [2024-10-14 12:11:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:11:05,302 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 179 transitions. [2024-10-14 12:11:05,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:11:05,302 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 179 transitions. [2024-10-14 12:11:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 12:11:05,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:11:05,304 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:11:05,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:11:05,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:11:05,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:11:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash -873876641, now seen corresponding path program 1 times [2024-10-14 12:11:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:11:05,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963442406] [2024-10-14 12:11:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:11:05,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:11:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 12:11:05,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [518980157] [2024-10-14 12:11:05,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:11:05,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:11:05,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:11:05,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 12:11:05,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 12:11:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:11:05,704 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 12:11:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 12:11:05,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 12:11:05,797 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 12:11:05,799 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 12:11:05,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 12:11:06,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:11:06,008 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 12:11:06,069 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 12:11:06,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 12:11:06 BoogieIcfgContainer [2024-10-14 12:11:06,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 12:11:06,073 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 12:11:06,074 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 12:11:06,074 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 12:11:06,074 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:11:01" (3/4) ... [2024-10-14 12:11:06,076 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 12:11:06,077 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 12:11:06,078 INFO L158 Benchmark]: Toolchain (without parser) took 6092.86ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 105.0MB in the beginning and 116.2MB in the end (delta: -11.3MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2024-10-14 12:11:06,079 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:11:06,079 INFO L158 Benchmark]: CACSL2BoogieTranslator took 413.00ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 90.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 12:11:06,079 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.09ms. Allocated memory is still 176.2MB. Free memory was 90.5MB in the beginning and 146.3MB in the end (delta: -55.8MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. [2024-10-14 12:11:06,080 INFO L158 Benchmark]: Boogie Preprocessor took 122.15ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 142.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 12:11:06,080 INFO L158 Benchmark]: RCFGBuilder took 653.37ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 117.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 12:11:06,081 INFO L158 Benchmark]: TraceAbstraction took 4771.79ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 117.0MB in the beginning and 116.2MB in the end (delta: 734.5kB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2024-10-14 12:11:06,081 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 228.6MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 12:11:06,083 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.16ms. Allocated memory is still 176.2MB. Free memory is still 135.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 413.00ms. Allocated memory is still 176.2MB. Free memory was 104.7MB in the beginning and 90.5MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.09ms. Allocated memory is still 176.2MB. Free memory was 90.5MB in the beginning and 146.3MB in the end (delta: -55.8MB). Peak memory consumption was 8.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.15ms. Allocated memory is still 176.2MB. Free memory was 146.3MB in the beginning and 142.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 653.37ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 117.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4771.79ms. Allocated memory was 176.2MB in the beginning and 228.6MB in the end (delta: 52.4MB). Free memory was 117.0MB in the beginning and 116.2MB in the end (delta: 734.5kB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 228.6MB. Free memory is still 116.2MB. 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of bitwiseOr at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] double last_1_var_1_9 = 4.6; [L36] unsigned char last_1_var_1_12 = 100; [L37] unsigned char last_1_var_1_14 = 0; [L38] signed long int last_1_var_1_16 = 0; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L108] last_1_var_1_9 = var_1_9 [L109] last_1_var_1_12 = var_1_12 [L110] last_1_var_1_14 = var_1_14 [L111] last_1_var_1_16 = var_1_16 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L91] var_1_5 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L92] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L93] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L93] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L94] var_1_7 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L95] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L96] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L96] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L97] var_1_8 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L98] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L99] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L99] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L100] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L100] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L101] var_1_10 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L102] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L103] var_1_13 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L104] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L105] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L105] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L122] RET updateVariables() [L123] CALL step() [L42] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L43] COND FALSE !(\read(last_1_var_1_14)) [L54] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L56] var_1_16 = last_1_var_1_12 [L57] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L58] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L59] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L60] COND FALSE !(stepLocal_5 >= var_1_16) [L63] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L66] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L67] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L67] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L68] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L72] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L73] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L74] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L77] COND FALSE !(stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1)) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L81] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L82] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L83] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L85] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L86] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L87] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=2] [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=2] [L114-L115] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 450 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 450 mSDsluCounter, 853 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 583 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 270 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=4, InterpolantAutomatonStates: 24, 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, 105 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 451 NumberOfCodeBlocks, 451 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 720/720 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-14 12:11:06,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-68.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6ae4314f4ba811ecc81374bb4df27f78b66c4c1beea0be05c76985457c985743 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:11:08,727 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:11:08,818 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 12:11:08,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:11:08,826 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:11:08,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:11:08,861 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:11:08,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:11:08,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:11:08,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:11:08,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:11:08,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:11:08,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:11:08,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:11:08,868 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:11:08,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:11:08,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:11:08,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:11:08,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:11:08,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:11:08,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:11:08,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:11:08,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:11:08,874 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 12:11:08,875 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 12:11:08,875 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:11:08,875 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 12:11:08,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:11:08,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:11:08,876 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:11:08,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:11:08,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:11:08,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:11:08,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:11:08,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:11:08,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:11:08,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:11:08,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:11:08,882 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 12:11:08,882 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 12:11:08,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:11:08,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:11:08,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:11:08,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:11:08,883 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 12:11:08,883 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/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 ! call(reach_error())) ) 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 -> 6ae4314f4ba811ecc81374bb4df27f78b66c4c1beea0be05c76985457c985743 [2024-10-14 12:11:09,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:11:09,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:11:09,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:11:09,298 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:11:09,298 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:11:09,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-68.i [2024-10-14 12:11:11,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:11:11,436 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:11:11,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-68.i [2024-10-14 12:11:11,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4418560/eeb24ddf6eda4aa19b152998b40b4e02/FLAG8770b70e8 [2024-10-14 12:11:11,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4418560/eeb24ddf6eda4aa19b152998b40b4e02 [2024-10-14 12:11:11,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:11:11,502 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:11:11,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:11:11,504 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:11:11,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:11:11,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:11,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@322920d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11, skipping insertion in model container [2024-10-14 12:11:11,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:11,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:11:11,724 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-68.i[915,928] [2024-10-14 12:11:11,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:11:11,832 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:11:11,844 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-68.i[915,928] [2024-10-14 12:11:11,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:11:11,904 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:11:11,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11 WrapperNode [2024-10-14 12:11:11,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:11:11,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:11:11,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:11:11,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:11:11,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:11,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:11,966 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-10-14 12:11:11,968 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:11:11,969 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:11:11,969 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:11:11,970 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:11:11,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:11,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:11,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:12,005 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-14 12:11:12,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:12,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:12,020 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:12,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:12,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:12,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:12,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:11:12,045 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:11:12,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:11:12,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:11:12,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (1/1) ... [2024-10-14 12:11:12,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:11:12,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:11:12,098 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:11:12,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:11:12,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:11:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 12:11:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:11:12,162 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:11:12,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:11:12,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:11:12,292 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:11:12,294 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:11:13,314 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-14 12:11:13,314 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:11:13,384 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:11:13,388 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:11:13,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:11:13 BoogieIcfgContainer [2024-10-14 12:11:13,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:11:13,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:11:13,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:11:13,399 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:11:13,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:11:11" (1/3) ... [2024-10-14 12:11:13,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14408b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:11:13, skipping insertion in model container [2024-10-14 12:11:13,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:11:11" (2/3) ... [2024-10-14 12:11:13,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14408b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:11:13, skipping insertion in model container [2024-10-14 12:11:13,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:11:13" (3/3) ... [2024-10-14 12:11:13,411 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-68.i [2024-10-14 12:11:13,434 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:11:13,435 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:11:13,515 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:11:13,525 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;@7b969ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:11:13,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:11:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 12:11:13,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 12:11:13,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:11:13,541 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:11:13,541 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:11:13,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:11:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1686192283, now seen corresponding path program 1 times [2024-10-14 12:11:13,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:11:13,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581952863] [2024-10-14 12:11:13,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:11:13,567 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-14 12:11:13,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:11:13,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-14 12:11:13,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 12:11:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:13,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 12:11:13,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:11:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-14 12:11:13,854 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:11:13,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:11:13,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581952863] [2024-10-14 12:11:13,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581952863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:11:13,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:11:13,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:11:13,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124445863] [2024-10-14 12:11:13,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:11:13,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:11:13,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:11:13,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:11:13,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:11:13,886 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 12:11:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:11:14,267 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2024-10-14 12:11:14,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:11:14,281 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2024-10-14 12:11:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:11:14,288 INFO L225 Difference]: With dead ends: 83 [2024-10-14 12:11:14,289 INFO L226 Difference]: Without dead ends: 41 [2024-10-14 12:11:14,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 70 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-14 12:11:14,296 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:11:14,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:11:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-14 12:11:14,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-14 12:11:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-10-14 12:11:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2024-10-14 12:11:14,337 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 71 [2024-10-14 12:11:14,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:11:14,337 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2024-10-14 12:11:14,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 12:11:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2024-10-14 12:11:14,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 12:11:14,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:11:14,342 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:11:14,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-10-14 12:11:14,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-14 12:11:14,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:11:14,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:11:14,549 INFO L85 PathProgramCache]: Analyzing trace with hash 643243369, now seen corresponding path program 1 times [2024-10-14 12:11:14,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:11:14,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271039328] [2024-10-14 12:11:14,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:11:14,551 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-14 12:11:14,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:11:14,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-14 12:11:14,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 12:11:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:14,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 12:11:14,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:11:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 12:11:15,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:11:15,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:11:15,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271039328] [2024-10-14 12:11:15,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271039328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:11:15,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:11:15,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 12:11:15,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173234719] [2024-10-14 12:11:15,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:11:15,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 12:11:15,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:11:15,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 12:11:15,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 12:11:15,049 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:11:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:11:16,665 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2024-10-14 12:11:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 12:11:16,678 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-10-14 12:11:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:11:16,681 INFO L225 Difference]: With dead ends: 177 [2024-10-14 12:11:16,681 INFO L226 Difference]: Without dead ends: 137 [2024-10-14 12:11:16,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-14 12:11:16,683 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 172 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:11:16,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 263 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 12:11:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-14 12:11:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 68. [2024-10-14 12:11:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 12:11:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2024-10-14 12:11:16,707 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 71 [2024-10-14 12:11:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:11:16,708 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 100 transitions. [2024-10-14 12:11:16,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:11:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 100 transitions. [2024-10-14 12:11:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 12:11:16,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:11:16,710 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:11:16,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 12:11:16,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-14 12:11:16,914 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:11:16,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:11:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash 250216359, now seen corresponding path program 1 times [2024-10-14 12:11:16,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:11:16,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185201478] [2024-10-14 12:11:16,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:11:16,916 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-14 12:11:16,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:11:16,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-14 12:11:16,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 12:11:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:17,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 12:11:17,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 12:11:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-10-14 12:11:17,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 12:11:17,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 12:11:17,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185201478] [2024-10-14 12:11:17,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185201478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:11:17,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:11:17,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:11:17,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271439790] [2024-10-14 12:11:17,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:11:17,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:11:17,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 12:11:17,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:11:17,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:11:17,162 INFO L87 Difference]: Start difference. First operand 68 states and 100 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:11:17,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:11:17,813 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2024-10-14 12:11:17,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:11:17,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-10-14 12:11:17,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:11:17,829 INFO L225 Difference]: With dead ends: 108 [2024-10-14 12:11:17,829 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 12:11:17,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:11:17,831 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 54 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 12:11:17,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 95 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 12:11:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 12:11:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-14 12:11:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 12:11:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 99 transitions. [2024-10-14 12:11:17,845 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 99 transitions. Word has length 71 [2024-10-14 12:11:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:11:17,846 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 99 transitions. [2024-10-14 12:11:17,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-14 12:11:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 99 transitions. [2024-10-14 12:11:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 12:11:17,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:11:17,848 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:11:17,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-14 12:11:18,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-14 12:11:18,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:11:18,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:11:18,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2125272595, now seen corresponding path program 1 times [2024-10-14 12:11:18,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 12:11:18,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632059878] [2024-10-14 12:11:18,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:11:18,053 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-14 12:11:18,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 12:11:18,056 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-14 12:11:18,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (5)] Waiting until timeout for monitored process [2024-10-14 12:11:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:11:18,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 12:11:18,230 INFO L278 TraceCheckSpWp]: Computing forward predicates...