./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-89.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 c2c3bc2dc26c2558761493393203484f1e6d565a95170aac1e726e11bfe9e50e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:19:23,422 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:19:23,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:19:23,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:19:23,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:19:23,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:19:23,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:19:23,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:19:23,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:19:23,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:19:23,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:19:23,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:19:23,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:19:23,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:19:23,562 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:19:23,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:19:23,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:19:23,563 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:19:23,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:19:23,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:19:23,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:19:23,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:19:23,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:19:23,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:19:23,569 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:19:23,569 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:19:23,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:19:23,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:19:23,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:19:23,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:19:23,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:19:23,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:19:23,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:23,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:19:23,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:19:23,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:19:23,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:19:23,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:19:23,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:19:23,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:19:23,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:19:23,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:19:23,575 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 -> c2c3bc2dc26c2558761493393203484f1e6d565a95170aac1e726e11bfe9e50e [2024-11-09 00:19:23,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:19:23,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:19:23,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:19:23,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:19:23,879 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:19:23,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-89.i [2024-11-09 00:19:25,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:19:25,579 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:19:25,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-89.i [2024-11-09 00:19:25,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25976ddb2/7442999a4e924821976554e547e96cb4/FLAG664c20845 [2024-11-09 00:19:25,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25976ddb2/7442999a4e924821976554e547e96cb4 [2024-11-09 00:19:25,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:19:25,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:19:25,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:25,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:19:25,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:19:25,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:25" (1/1) ... [2024-11-09 00:19:25,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a1a9357 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:25, skipping insertion in model container [2024-11-09 00:19:25,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:25" (1/1) ... [2024-11-09 00:19:25,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:19:26,161 WARN L250 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-89.i[915,928] [2024-11-09 00:19:26,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:26,238 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:19:26,249 WARN L250 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-89.i[915,928] [2024-11-09 00:19:26,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:26,289 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:19:26,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26 WrapperNode [2024-11-09 00:19:26,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:26,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:26,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:19:26,292 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:19:26,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,346 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2024-11-09 00:19:26,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:26,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:19:26,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:19:26,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:19:26,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,400 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-11-09 00:19:26,401 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,401 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:19:26,440 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:19:26,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:19:26,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:19:26,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (1/1) ... [2024-11-09 00:19:26,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:26,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:26,475 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-11-09 00:19:26,482 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-11-09 00:19:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:19:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:19:26,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:19:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:19:26,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:19:26,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:19:26,615 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:19:26,617 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:19:26,935 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 00:19:26,935 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:19:26,951 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:19:26,952 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:19:26,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:26 BoogieIcfgContainer [2024-11-09 00:19:26,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:19:26,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:19:26,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:19:26,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:19:26,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:19:25" (1/3) ... [2024-11-09 00:19:26,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1f0478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:26, skipping insertion in model container [2024-11-09 00:19:26,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:26" (2/3) ... [2024-11-09 00:19:26,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1f0478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:26, skipping insertion in model container [2024-11-09 00:19:26,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:26" (3/3) ... [2024-11-09 00:19:26,962 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-89.i [2024-11-09 00:19:26,977 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:19:26,978 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:19:27,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:19:27,052 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;@3e35fa78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:19:27,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:19:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 00:19:27,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 00:19:27,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:27,072 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:19:27,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:27,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:27,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1954295536, now seen corresponding path program 1 times [2024-11-09 00:19:27,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:27,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099865299] [2024-11-09 00:19:27,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:27,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:19:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:19:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:19:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:19:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:19:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:19:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:19:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:19:27,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:19:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:19:27,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:19:27,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:19:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:27,458 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:19:27,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:19:27,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099865299] [2024-11-09 00:19:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099865299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:27,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:27,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:19:27,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468889869] [2024-11-09 00:19:27,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:27,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:19:27,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:19:27,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:19:27,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:19:27,493 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 00:19:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:27,515 INFO L93 Difference]: Finished difference Result 97 states and 164 transitions. [2024-11-09 00:19:27,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:19:27,518 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-11-09 00:19:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:27,526 INFO L225 Difference]: With dead ends: 97 [2024-11-09 00:19:27,526 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 00:19:27,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-11-09 00:19:27,533 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:19:27,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:19:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 00:19:27,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-09 00:19:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 00:19:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2024-11-09 00:19:27,572 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 83 [2024-11-09 00:19:27,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:27,572 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2024-11-09 00:19:27,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 00:19:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2024-11-09 00:19:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 00:19:27,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:27,576 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:19:27,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:19:27,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:27,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:27,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1061366768, now seen corresponding path program 1 times [2024-11-09 00:19:27,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:27,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676305222] [2024-11-09 00:19:27,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:27,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:19:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:19:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:19:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:19:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:19:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:19:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:19:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:19:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:19:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:19:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:19:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:19:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:19:28,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:19:28,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676305222] [2024-11-09 00:19:28,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676305222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:28,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:28,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:19:28,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131908230] [2024-11-09 00:19:28,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:28,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:19:28,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:19:28,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:19:28,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:19:28,179 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:19:28,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:28,253 INFO L93 Difference]: Finished difference Result 137 states and 208 transitions. [2024-11-09 00:19:28,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:19:28,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-09 00:19:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:28,257 INFO L225 Difference]: With dead ends: 137 [2024-11-09 00:19:28,257 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 00:19:28,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:19:28,260 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 35 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:19:28,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:19:28,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 00:19:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2024-11-09 00:19:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.360655737704918) internal successors, (83), 61 states have internal predecessors, (83), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:19:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2024-11-09 00:19:28,291 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 83 [2024-11-09 00:19:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:28,291 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2024-11-09 00:19:28,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:19:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2024-11-09 00:19:28,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 00:19:28,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:28,294 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:19:28,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:19:28,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:28,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:28,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1299635186, now seen corresponding path program 1 times [2024-11-09 00:19:28,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:19:28,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110819291] [2024-11-09 00:19:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:28,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:19:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:19:28,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [370271408] [2024-11-09 00:19:28,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:28,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:19:28,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:28,383 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-11-09 00:19:28,385 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-11-09 00:19:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:19:28,498 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:19:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:19:28,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:19:28,588 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:19:28,589 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:19:28,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 00:19:28,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:19:28,802 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 00:19:28,899 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:19:28,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:19:28 BoogieIcfgContainer [2024-11-09 00:19:28,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:19:28,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:19:28,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:19:28,911 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:19:28,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:26" (3/4) ... [2024-11-09 00:19:28,914 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:19:28,915 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:19:28,916 INFO L158 Benchmark]: Toolchain (without parser) took 2981.39ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 141.8MB in the beginning and 135.7MB in the end (delta: 6.1MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-11-09 00:19:28,920 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 87.5MB in the beginning and 87.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:19:28,921 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.84ms. Allocated memory is still 172.0MB. Free memory was 141.1MB in the beginning and 125.7MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:19:28,921 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.39ms. Allocated memory is still 172.0MB. Free memory was 125.7MB in the beginning and 122.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:19:28,921 INFO L158 Benchmark]: Boogie Preprocessor took 91.47ms. Allocated memory is still 172.0MB. Free memory was 122.3MB in the beginning and 117.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:19:28,922 INFO L158 Benchmark]: RCFGBuilder took 512.66ms. Allocated memory is still 172.0MB. Free memory was 117.3MB in the beginning and 97.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:19:28,922 INFO L158 Benchmark]: TraceAbstraction took 1955.37ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 97.1MB in the beginning and 135.7MB in the end (delta: -38.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:19:28,922 INFO L158 Benchmark]: Witness Printer took 5.19ms. Allocated memory is still 207.6MB. Free memory is still 135.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:19:28,925 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.17ms. Allocated memory is still 125.8MB. Free memory was 87.5MB in the beginning and 87.4MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.84ms. Allocated memory is still 172.0MB. Free memory was 141.1MB in the beginning and 125.7MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.39ms. Allocated memory is still 172.0MB. Free memory was 125.7MB in the beginning and 122.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.47ms. Allocated memory is still 172.0MB. Free memory was 122.3MB in the beginning and 117.3MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 512.66ms. Allocated memory is still 172.0MB. Free memory was 117.3MB in the beginning and 97.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1955.37ms. Allocated memory was 172.0MB in the beginning and 207.6MB in the end (delta: 35.7MB). Free memory was 97.1MB in the beginning and 135.7MB in the end (delta: -38.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.19ms. Allocated memory is still 207.6MB. Free memory is still 135.7MB. 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 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_8 = 32; [L25] signed long int var_1_9 = -16; [L26] unsigned short int var_1_10 = 5; [L27] unsigned char var_1_12 = 32; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 0; [L30] unsigned char var_1_15 = 0; [L31] double var_1_16 = 63.75; [L32] double var_1_17 = 8.5; [L33] signed short int var_1_18 = -64; [L34] signed long int last_1_var_1_1 = 32; [L35] unsigned char last_1_var_1_12 = 32; [L36] signed short int last_1_var_1_18 = -64; VAL [isInitial=0, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=-16] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L115] last_1_var_1_1 = var_1_1 [L116] last_1_var_1_12 = var_1_12 [L117] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=-16] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_8=32, var_1_9=-16] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_8=32, var_1_9=-16] [L97] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=-16] [L97] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=-16] [L98] var_1_9 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L99] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L100] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L100] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L101] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L101] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L102] var_1_10 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L103] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L104] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L104] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L105] var_1_13 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L106] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L107] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L107] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L108] var_1_15 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L109] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L110] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L110] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L111] var_1_17 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L112] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L128] RET updateVariables() [L129] CALL step() [L40] signed long int stepLocal_1 = last_1_var_1_18; [L41] signed long int stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_1=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L42] COND FALSE !(stepLocal_1 >= (last_1_var_1_18 / var_1_9)) [L49] var_1_8 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L51] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L52] COND FALSE !(var_1_10 < var_1_18) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L63] unsigned short int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_2=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L64] COND FALSE !(stepLocal_2 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L75] COND FALSE !(var_1_18 != var_1_12) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L80] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L87] COND FALSE !(\read(var_1_14)) [L90] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return ((((((var_1_18 != var_1_12) ? (var_1_14 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) < (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18))))) ? (((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) : (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18)))))))) : 1) : 1) && ((last_1_var_1_18 >= (last_1_var_1_18 / var_1_9)) ? ((last_1_var_1_18 < (last_1_var_1_1 * 256)) ? (var_1_8 == ((unsigned short int) ((((last_1_var_1_12) < (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12))))) ? (last_1_var_1_12) : (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12)))))))) : (var_1_8 == ((unsigned short int) last_1_var_1_12))) : (var_1_8 == ((unsigned short int) last_1_var_1_12)))) && ((var_1_10 < var_1_18) ? ((last_1_var_1_12 <= (5 - last_1_var_1_12)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((last_1_var_1_12 == var_1_8) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_8 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) ? ((! (var_1_8 >= var_1_12)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_14 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_1=32, var_1_4=0, var_1_8=32, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 199 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 140 mSDtfsCounter, 13 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=2, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 528/528 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-11-09 00:19:28,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-89.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 c2c3bc2dc26c2558761493393203484f1e6d565a95170aac1e726e11bfe9e50e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:19:31,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:19:31,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:19:31,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:19:31,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:19:31,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:19:31,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:19:31,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:19:31,327 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:19:31,327 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:19:31,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:19:31,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:19:31,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:19:31,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:19:31,331 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:19:31,332 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:19:31,332 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:19:31,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:19:31,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:19:31,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:19:31,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:19:31,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:19:31,337 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:19:31,338 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:19:31,338 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:19:31,338 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:19:31,338 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:19:31,339 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:19:31,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:19:31,339 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:19:31,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:19:31,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:19:31,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:19:31,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:19:31,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:31,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:19:31,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:19:31,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:19:31,353 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:19:31,353 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:19:31,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:19:31,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:19:31,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:19:31,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:19:31,355 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 -> c2c3bc2dc26c2558761493393203484f1e6d565a95170aac1e726e11bfe9e50e [2024-11-09 00:19:31,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:19:31,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:19:31,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:19:31,693 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:19:31,693 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:19:31,695 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-89.i [2024-11-09 00:19:33,224 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:19:33,455 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:19:33,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-89.i [2024-11-09 00:19:33,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ddb1597/67ae05bb013645538519adba3957663b/FLAG66a0e7dac [2024-11-09 00:19:33,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ddb1597/67ae05bb013645538519adba3957663b [2024-11-09 00:19:33,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:19:33,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:19:33,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:33,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:19:33,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:19:33,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:33" (1/1) ... [2024-11-09 00:19:33,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a35b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:33, skipping insertion in model container [2024-11-09 00:19:33,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:19:33" (1/1) ... [2024-11-09 00:19:33,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:19:34,035 WARN L250 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-89.i[915,928] [2024-11-09 00:19:34,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:34,105 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:19:34,118 WARN L250 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-89.i[915,928] [2024-11-09 00:19:34,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:19:34,174 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:19:34,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34 WrapperNode [2024-11-09 00:19:34,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:19:34,175 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:34,175 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:19:34,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:19:34,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,227 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 113 [2024-11-09 00:19:34,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:19:34,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:19:34,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:19:34,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:19:34,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,256 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-11-09 00:19:34,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:19:34,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:19:34,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:19:34,300 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:19:34,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (1/1) ... [2024-11-09 00:19:34,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:19:34,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:19:34,344 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-11-09 00:19:34,347 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-11-09 00:19:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:19:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:19:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:19:34,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:19:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:19:34,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:19:34,489 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:19:34,492 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:19:35,063 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 00:19:35,063 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:19:35,081 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:19:35,081 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:19:35,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:35 BoogieIcfgContainer [2024-11-09 00:19:35,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:19:35,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:19:35,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:19:35,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:19:35,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:19:33" (1/3) ... [2024-11-09 00:19:35,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3796c77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:35, skipping insertion in model container [2024-11-09 00:19:35,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:19:34" (2/3) ... [2024-11-09 00:19:35,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3796c77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:19:35, skipping insertion in model container [2024-11-09 00:19:35,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:19:35" (3/3) ... [2024-11-09 00:19:35,093 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-89.i [2024-11-09 00:19:35,109 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:19:35,110 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:19:35,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:19:35,189 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;@723062a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:19:35,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:19:35,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 00:19:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 00:19:35,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:35,205 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:19:35,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:35,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:35,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1954295536, now seen corresponding path program 1 times [2024-11-09 00:19:35,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:19:35,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290098072] [2024-11-09 00:19:35,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:35,227 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-11-09 00:19:35,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:19:35,231 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-11-09 00:19:35,233 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-11-09 00:19:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:35,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:19:35,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:19:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-09 00:19:35,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:19:35,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:19:35,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290098072] [2024-11-09 00:19:35,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290098072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:35,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:35,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:19:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284578582] [2024-11-09 00:19:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:35,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:19:35,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:19:35,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:19:35,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:19:35,602 INFO L87 Difference]: Start difference. First operand has 52 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 00:19:35,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:35,628 INFO L93 Difference]: Finished difference Result 97 states and 164 transitions. [2024-11-09 00:19:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:19:35,631 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2024-11-09 00:19:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:35,639 INFO L225 Difference]: With dead ends: 97 [2024-11-09 00:19:35,639 INFO L226 Difference]: Without dead ends: 48 [2024-11-09 00:19:35,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 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-11-09 00:19:35,657 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:19:35,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:19:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-09 00:19:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-09 00:19:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 00:19:35,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 72 transitions. [2024-11-09 00:19:35,708 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 72 transitions. Word has length 83 [2024-11-09 00:19:35,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:35,710 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 72 transitions. [2024-11-09 00:19:35,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 00:19:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 72 transitions. [2024-11-09 00:19:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 00:19:35,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:35,715 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:19:35,726 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-11-09 00:19:35,915 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-11-09 00:19:35,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:35,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1061366768, now seen corresponding path program 1 times [2024-11-09 00:19:35,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:19:35,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869988230] [2024-11-09 00:19:35,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:35,919 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-11-09 00:19:35,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:19:35,922 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-11-09 00:19:35,924 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-11-09 00:19:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:36,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 00:19:36,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:19:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 00:19:36,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:19:36,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:19:36,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869988230] [2024-11-09 00:19:36,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869988230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:19:36,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:19:36,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:19:36,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693198458] [2024-11-09 00:19:36,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:19:36,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:19:36,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:19:36,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:19:36,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:19:36,443 INFO L87 Difference]: Start difference. First operand 48 states and 72 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:19:36,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:19:36,630 INFO L93 Difference]: Finished difference Result 136 states and 206 transitions. [2024-11-09 00:19:36,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:19:36,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 83 [2024-11-09 00:19:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:19:36,634 INFO L225 Difference]: With dead ends: 136 [2024-11-09 00:19:36,634 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 00:19:36,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:19:36,636 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 20 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:19:36,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 126 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:19:36,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 00:19:36,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-09 00:19:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-09 00:19:36,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 129 transitions. [2024-11-09 00:19:36,662 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 129 transitions. Word has length 83 [2024-11-09 00:19:36,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:19:36,662 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 129 transitions. [2024-11-09 00:19:36,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 00:19:36,663 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 129 transitions. [2024-11-09 00:19:36,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 00:19:36,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:19:36,666 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:19:36,680 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-11-09 00:19:36,866 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-11-09 00:19:36,867 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:19:36,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:19:36,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1299635186, now seen corresponding path program 1 times [2024-11-09 00:19:36,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:19:36,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393561361] [2024-11-09 00:19:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:19:36,870 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-11-09 00:19:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:19:36,872 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-11-09 00:19:36,873 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-11-09 00:19:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:19:37,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 00:19:37,098 INFO L278 TraceCheckSpWp]: Computing forward predicates...