./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.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 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:41:43,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:41:43,910 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:41:43,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:41:43,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:41:43,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:41:43,944 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:41:43,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:41:43,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:41:43,947 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:41:43,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:41:43,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:41:43,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:41:43,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:41:43,949 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:41:43,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:41:43,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:41:43,951 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:41:43,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:41:43,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:41:43,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:41:43,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:41:43,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:41:43,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:41:43,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:41:43,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:41:43,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:41:43,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:41:43,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:41:43,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:41:43,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:41:43,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:41:43,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:41:43,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:41:43,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:41:43,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:41:43,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:41:43,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:41:43,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:41:43,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:41:43,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:41:43,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:41:43,962 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 -> 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 [2024-10-14 07:41:44,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:41:44,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:41:44,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:41:44,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:41:44,258 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:41:44,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2024-10-14 07:41:45,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:41:46,001 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:41:46,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2024-10-14 07:41:46,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54670ae12/063b7f0077914b7a97fffcb7769c7342/FLAG4ded653fb [2024-10-14 07:41:46,371 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54670ae12/063b7f0077914b7a97fffcb7769c7342 [2024-10-14 07:41:46,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:41:46,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:41:46,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:41:46,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:41:46,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:41:46,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dada65e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46, skipping insertion in model container [2024-10-14 07:41:46,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:41:46,561 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i[917,930] [2024-10-14 07:41:46,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:41:46,641 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:41:46,651 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i[917,930] [2024-10-14 07:41:46,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:41:46,700 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:41:46,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46 WrapperNode [2024-10-14 07:41:46,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:41:46,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:41:46,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:41:46,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:41:46,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,754 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-10-14 07:41:46,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:41:46,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:41:46,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:41:46,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:41:46,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,809 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:41:46,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:41:46,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:41:46,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:41:46,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:41:46,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (1/1) ... [2024-10-14 07:41:46,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:41:46,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:41:46,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:41:46,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:41:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:41:46,939 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:41:46,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:41:46,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:41:46,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:41:46,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:41:47,032 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:41:47,034 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:41:47,333 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 07:41:47,333 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:41:47,405 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:41:47,405 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:41:47,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:41:47 BoogieIcfgContainer [2024-10-14 07:41:47,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:41:47,409 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:41:47,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:41:47,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:41:47,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:41:46" (1/3) ... [2024-10-14 07:41:47,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cbe051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:41:47, skipping insertion in model container [2024-10-14 07:41:47,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:46" (2/3) ... [2024-10-14 07:41:47,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cbe051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:41:47, skipping insertion in model container [2024-10-14 07:41:47,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:41:47" (3/3) ... [2024-10-14 07:41:47,418 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-48.i [2024-10-14 07:41:47,463 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:41:47,463 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:41:47,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:41:47,544 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;@36ac212b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:41:47,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:41:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 07:41:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 07:41:47,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:41:47,561 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:41:47,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:41:47,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:41:47,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2026356256, now seen corresponding path program 1 times [2024-10-14 07:41:47,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:41:47,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791980221] [2024-10-14 07:41:47,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:41:47,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:41:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:41:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:41:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:41:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:41:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:41:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 07:41:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 07:41:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 07:41:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 07:41:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 07:41:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 07:41:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:41:47,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 07:41:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:41:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 07:41:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:41:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 07:41:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:41:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 07:41:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:41:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 07:41:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:47,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:41:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 07:41:48,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:41:48,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791980221] [2024-10-14 07:41:48,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791980221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:41:48,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:41:48,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:41:48,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296459127] [2024-10-14 07:41:48,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:41:48,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:41:48,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:41:48,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:41:48,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:41:48,045 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 07:41:48,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:41:48,097 INFO L93 Difference]: Finished difference Result 120 states and 214 transitions. [2024-10-14 07:41:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:41:48,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2024-10-14 07:41:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:41:48,110 INFO L225 Difference]: With dead ends: 120 [2024-10-14 07:41:48,111 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 07:41:48,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:41:48,118 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:41:48,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:41:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 07:41:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-14 07:41:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 07:41:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2024-10-14 07:41:48,175 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 136 [2024-10-14 07:41:48,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:41:48,175 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2024-10-14 07:41:48,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 07:41:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2024-10-14 07:41:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 07:41:48,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:41:48,181 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:41:48,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:41:48,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:41:48,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:41:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1592598632, now seen corresponding path program 1 times [2024-10-14 07:41:48,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:41:48,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502430666] [2024-10-14 07:41:48,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:41:48,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:41:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:41:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:41:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:41:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:41:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:41:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 07:41:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 07:41:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 07:41:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 07:41:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 07:41:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 07:41:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:41:48,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 07:41:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:41:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 07:41:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:41:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 07:41:48,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:41:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 07:41:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:41:48,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 07:41:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:41:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 07:41:48,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:41:48,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502430666] [2024-10-14 07:41:48,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502430666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:41:48,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:41:48,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:41:48,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137143830] [2024-10-14 07:41:48,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:41:48,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:41:48,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:41:48,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:41:48,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:41:48,508 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 07:41:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:41:48,566 INFO L93 Difference]: Finished difference Result 133 states and 203 transitions. [2024-10-14 07:41:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:41:48,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-10-14 07:41:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:41:48,572 INFO L225 Difference]: With dead ends: 133 [2024-10-14 07:41:48,572 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 07:41:48,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:41:48,576 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:41:48,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 165 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:41:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 07:41:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2024-10-14 07:41:48,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 07:41:48,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 97 transitions. [2024-10-14 07:41:48,595 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 97 transitions. Word has length 136 [2024-10-14 07:41:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:41:48,598 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 97 transitions. [2024-10-14 07:41:48,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 07:41:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 97 transitions. [2024-10-14 07:41:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 07:41:48,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:41:48,603 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:41:48,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:41:48,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:41:48,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:41:48,604 INFO L85 PathProgramCache]: Analyzing trace with hash -927361302, now seen corresponding path program 1 times [2024-10-14 07:41:48,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:41:48,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032942841] [2024-10-14 07:41:48,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:41:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:41:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:41:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:41:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:41:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 07:41:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 07:41:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 07:41:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 07:41:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 07:41:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 07:41:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 07:41:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 07:41:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 07:41:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 07:41:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 07:41:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 07:41:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:41:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 07:41:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:41:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 07:41:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:41:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 07:41:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-14 07:41:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:41:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 07:41:49,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:41:49,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032942841] [2024-10-14 07:41:49,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032942841] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:41:49,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:41:49,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:41:49,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893821476] [2024-10-14 07:41:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:41:49,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:41:49,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:41:49,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:41:49,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:41:49,338 INFO L87 Difference]: Start difference. First operand 64 states and 97 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-10-14 07:41:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:41:49,586 INFO L93 Difference]: Finished difference Result 190 states and 289 transitions. [2024-10-14 07:41:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:41:49,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 136 [2024-10-14 07:41:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:41:49,589 INFO L225 Difference]: With dead ends: 190 [2024-10-14 07:41:49,589 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 07:41:49,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:41:49,594 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 95 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:41:49,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 262 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:41:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 07:41:49,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-10-14 07:41:49,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 07:41:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2024-10-14 07:41:49,628 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 136 [2024-10-14 07:41:49,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:41:49,629 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2024-10-14 07:41:49,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-10-14 07:41:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2024-10-14 07:41:49,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 07:41:49,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:41:49,636 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:41:49,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:41:49,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:41:49,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:41:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash -925514260, now seen corresponding path program 1 times [2024-10-14 07:41:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:41:49,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138678725] [2024-10-14 07:41:49,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:41:49,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:41:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:41:49,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:41:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:41:49,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:41:49,891 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:41:49,892 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:41:49,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:41:49,897 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-14 07:41:49,987 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:41:49,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:41:49 BoogieIcfgContainer [2024-10-14 07:41:49,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:41:49,992 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:41:49,992 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:41:49,992 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:41:49,993 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:41:47" (3/4) ... [2024-10-14 07:41:49,996 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:41:49,998 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:41:50,000 INFO L158 Benchmark]: Toolchain (without parser) took 3622.91ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 119.1MB in the beginning and 114.6MB in the end (delta: 4.5MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2024-10-14 07:41:50,000 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:41:50,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.89ms. Allocated memory is still 176.2MB. Free memory was 119.1MB in the beginning and 104.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 07:41:50,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.01ms. Allocated memory is still 176.2MB. Free memory was 104.0MB in the beginning and 100.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:41:50,001 INFO L158 Benchmark]: Boogie Preprocessor took 78.88ms. Allocated memory is still 176.2MB. Free memory was 100.8MB in the beginning and 95.4MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:41:50,001 INFO L158 Benchmark]: RCFGBuilder took 570.31ms. Allocated memory is still 176.2MB. Free memory was 95.4MB in the beginning and 143.2MB in the end (delta: -47.7MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. [2024-10-14 07:41:50,002 INFO L158 Benchmark]: TraceAbstraction took 2582.29ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 142.5MB in the beginning and 114.6MB in the end (delta: 27.9MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2024-10-14 07:41:50,002 INFO L158 Benchmark]: Witness Printer took 5.49ms. Allocated memory is still 243.3MB. Free memory is still 114.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:41:50,007 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 138.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.89ms. Allocated memory is still 176.2MB. Free memory was 119.1MB in the beginning and 104.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.01ms. Allocated memory is still 176.2MB. Free memory was 104.0MB in the beginning and 100.8MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.88ms. Allocated memory is still 176.2MB. Free memory was 100.8MB in the beginning and 95.4MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 570.31ms. Allocated memory is still 176.2MB. Free memory was 95.4MB in the beginning and 143.2MB in the end (delta: -47.7MB). Peak memory consumption was 31.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2582.29ms. Allocated memory was 176.2MB in the beginning and 243.3MB in the end (delta: 67.1MB). Free memory was 142.5MB in the beginning and 114.6MB in the end (delta: 27.9MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * Witness Printer took 5.49ms. Allocated memory is still 243.3MB. Free memory is still 114.6MB. 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 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] signed long int var_1_19 = 128; [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L99] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] var_1_3 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L102] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L103] var_1_4 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L104] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L105] var_1_5 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L106] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L107] var_1_6 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L108] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L109] var_1_7 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L110] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L111] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5, var_1_9=307/20] [L111] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5, var_1_9=307/20] [L112] var_1_9 = __VERIFIER_nondet_double() [L113] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L113] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L114] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L114] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L115] var_1_10 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L116] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L117] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L117] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L118] var_1_11 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L119] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L120] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L120] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L121] var_1_15 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L122] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L123] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L123] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L124] var_1_16 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L125] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L126] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L126] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L127] var_1_17 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L128] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L129] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L129] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=128, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L130] var_1_19 = __VERIFIER_nondet_long() [L131] CALL assume_abort_if_not(var_1_19 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L131] RET assume_abort_if_not(var_1_19 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L132] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L132] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=10, var_1_2=0, var_1_7=-65536, var_1_8=5] [L145] RET updateVariables() [L146] CALL step() [L44] COND FALSE !(\read(var_1_2)) [L51] var_1_1 = 1 VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=5] [L53] unsigned short int stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=5] [L54] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L55] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L63] COND FALSE !(\read(var_1_2)) [L72] var_1_12 = var_1_8 VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L74] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L77] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_13)) ? ((var_1_15 - var_1_16)) : (var_1_13)); VAL [isInitial=1, stepLocal_0=-65536, stepLocal_1=256, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=1, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L78] COND FALSE !(var_1_10 == stepLocal_1) [L81] var_1_14 = var_1_17 VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=0, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=64, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L83] COND TRUE var_1_7 == var_1_12 [L84] var_1_18 = (var_1_10 + ((((var_1_8) < (var_1_16)) ? (var_1_8) : (var_1_16)))) VAL [isInitial=1, stepLocal_0=-65536, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=0, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + var_1_7))) : (var_1_1 == ((unsigned short int) var_1_7))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (var_1_1 + var_1_10)))) : (var_1_12 == ((signed long int) var_1_1))) : 1) : (var_1_12 == ((signed long int) var_1_8)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_13)) ? ((var_1_15 - var_1_16)) : (var_1_13)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_7 == var_1_12) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_8) < (var_1_16)) ? (var_1_8) : (var_1_16)))))) : ((var_1_14 != var_1_16) ? ((-256 >= var_1_19) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=0, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=256, var_1_14=0, var_1_15=131, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=1, var_1_2=0, var_1_7=-65536, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 4, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 514 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 257 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 113 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 257 mSDtfsCounter, 113 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=3, InterpolantAutomatonStates: 9, 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, 3 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 544 NumberOfCodeBlocks, 544 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 927 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2772/2772 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 07:41:50,045 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.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 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:41:52,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:41:52,315 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:41:52,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:41:52,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:41:52,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:41:52,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:41:52,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:41:52,348 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:41:52,349 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:41:52,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:41:52,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:41:52,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:41:52,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:41:52,351 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:41:52,351 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:41:52,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:41:52,351 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:41:52,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:41:52,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:41:52,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:41:52,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:41:52,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:41:52,358 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:41:52,362 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:41:52,362 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:41:52,362 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:41:52,363 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:41:52,363 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:41:52,363 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:41:52,363 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:41:52,364 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:41:52,364 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:41:52,364 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:41:52,364 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:41:52,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:41:52,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:41:52,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:41:52,365 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:41:52,365 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:41:52,366 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:41:52,366 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:41:52,366 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:41:52,367 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:41:52,367 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:41:52,367 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 -> 171a765531b95b232fbab2e745bfaf521ee849c63dff03ab59f51e1f7468f906 [2024-10-14 07:41:52,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:41:52,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:41:52,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:41:52,713 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:41:52,713 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:41:52,716 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2024-10-14 07:41:54,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:41:54,475 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:41:54,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i [2024-10-14 07:41:54,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78da9e03d/81e68056096f44d3a38c792dc40c564e/FLAG4d28c0366 [2024-10-14 07:41:54,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78da9e03d/81e68056096f44d3a38c792dc40c564e [2024-10-14 07:41:54,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:41:54,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:41:54,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:41:54,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:41:54,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:41:54,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:41:54" (1/1) ... [2024-10-14 07:41:54,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da99f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:54, skipping insertion in model container [2024-10-14 07:41:54,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:41:54" (1/1) ... [2024-10-14 07:41:54,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:41:55,052 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i[917,930] [2024-10-14 07:41:55,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:41:55,144 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:41:55,158 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-48.i[917,930] [2024-10-14 07:41:55,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:41:55,249 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:41:55,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55 WrapperNode [2024-10-14 07:41:55,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:41:55,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:41:55,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:41:55,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:41:55,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,312 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-10-14 07:41:55,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:41:55,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:41:55,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:41:55,318 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:41:55,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,331 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,356 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 07:41:55,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:41:55,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:41:55,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:41:55,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:41:55,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (1/1) ... [2024-10-14 07:41:55,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:41:55,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:41:55,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:41:55,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:41:55,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:41:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:41:55,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:41:55,481 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:41:55,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:41:55,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:41:55,572 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:41:55,575 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:42:15,596 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 07:42:15,597 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:42:15,681 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:42:15,683 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:42:15,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:42:15 BoogieIcfgContainer [2024-10-14 07:42:15,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:42:15,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:42:15,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:42:15,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:42:15,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:41:54" (1/3) ... [2024-10-14 07:42:15,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10927c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:42:15, skipping insertion in model container [2024-10-14 07:42:15,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:41:55" (2/3) ... [2024-10-14 07:42:15,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10927c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:42:15, skipping insertion in model container [2024-10-14 07:42:15,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:42:15" (3/3) ... [2024-10-14 07:42:15,696 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-48.i [2024-10-14 07:42:15,715 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:42:15,716 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:42:15,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:42:15,798 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;@921fb04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:42:15,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:42:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 07:42:15,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 07:42:15,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:42:15,818 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:42:15,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:42:15,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:42:15,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2026356256, now seen corresponding path program 1 times [2024-10-14 07:42:15,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:42:15,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386213618] [2024-10-14 07:42:15,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:15,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:42:15,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:42:15,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:42:15,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:42:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:17,308 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:42:17,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:42:17,370 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-10-14 07:42:17,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:42:17,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:42:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386213618] [2024-10-14 07:42:17,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386213618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:42:17,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:42:17,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:42:17,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873104537] [2024-10-14 07:42:17,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:42:17,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:42:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:42:17,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:42:17,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:42:17,413 INFO L87 Difference]: Start difference. First operand has 62 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 38 states have internal predecessors, (54), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 07:42:21,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:42:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:42:21,912 INFO L93 Difference]: Finished difference Result 120 states and 214 transitions. [2024-10-14 07:42:22,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:42:22,082 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2024-10-14 07:42:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:42:22,088 INFO L225 Difference]: With dead ends: 120 [2024-10-14 07:42:22,088 INFO L226 Difference]: Without dead ends: 59 [2024-10-14 07:42:22,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:42:22,094 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:42:22,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 07:42:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-14 07:42:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-14 07:42:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 07:42:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2024-10-14 07:42:22,160 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 90 transitions. Word has length 136 [2024-10-14 07:42:22,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:42:22,162 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 90 transitions. [2024-10-14 07:42:22,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 07:42:22,163 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 90 transitions. [2024-10-14 07:42:22,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 07:42:22,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:42:22,168 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:42:22,217 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-14 07:42:22,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:42:22,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:42:22,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:42:22,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1592598632, now seen corresponding path program 1 times [2024-10-14 07:42:22,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:42:22,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138634443] [2024-10-14 07:42:22,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:22,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:42:22,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:42:22,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:42:22,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:42:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:23,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 07:42:23,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:42:24,067 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 07:42:24,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:42:24,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:42:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138634443] [2024-10-14 07:42:24,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138634443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:42:24,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:42:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:42:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733330529] [2024-10-14 07:42:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:42:24,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:42:24,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:42:24,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:42:24,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:42:24,072 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 07:42:28,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:42:32,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:42:36,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:42:36,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:42:36,989 INFO L93 Difference]: Finished difference Result 133 states and 203 transitions. [2024-10-14 07:42:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:42:36,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-10-14 07:42:36,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:42:36,994 INFO L225 Difference]: With dead ends: 133 [2024-10-14 07:42:36,994 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 07:42:36,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:42:36,996 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 18 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-10-14 07:42:36,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 164 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2024-10-14 07:42:36,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 07:42:37,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2024-10-14 07:42:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.325) internal successors, (53), 40 states have internal predecessors, (53), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 07:42:37,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 97 transitions. [2024-10-14 07:42:37,008 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 97 transitions. Word has length 136 [2024-10-14 07:42:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:42:37,010 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 97 transitions. [2024-10-14 07:42:37,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 07:42:37,011 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 97 transitions. [2024-10-14 07:42:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 07:42:37,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:42:37,013 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:42:37,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 07:42:37,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:42:37,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:42:37,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:42:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash -927361302, now seen corresponding path program 1 times [2024-10-14 07:42:37,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:42:37,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857726045] [2024-10-14 07:42:37,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:42:37,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:42:37,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:42:37,218 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:42:37,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 07:42:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:42:38,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 07:42:38,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:42:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 07:42:44,767 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:42:44,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:42:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857726045] [2024-10-14 07:42:44,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [857726045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:42:44,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:42:44,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:42:44,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437750636] [2024-10-14 07:42:44,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:42:44,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:42:44,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:42:44,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:42:44,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:42:44,770 INFO L87 Difference]: Start difference. First operand 64 states and 97 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 07:42:49,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:42:53,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:42:57,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:43:01,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:43:05,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:43:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:43:05,842 INFO L93 Difference]: Finished difference Result 190 states and 289 transitions. [2024-10-14 07:43:05,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:43:05,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-10-14 07:43:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:43:05,846 INFO L225 Difference]: With dead ends: 190 [2024-10-14 07:43:05,846 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 07:43:05,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:43:05,848 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 21 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2024-10-14 07:43:05,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 253 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 5 Unknown, 0 Unchecked, 20.9s Time] [2024-10-14 07:43:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 07:43:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-10-14 07:43:05,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 78 states have internal predecessors, (103), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 07:43:05,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2024-10-14 07:43:05,881 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 136 [2024-10-14 07:43:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:43:05,883 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2024-10-14 07:43:05,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 07:43:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2024-10-14 07:43:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 07:43:05,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:43:05,887 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:43:05,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 07:43:06,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:43:06,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:43:06,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:43:06,088 INFO L85 PathProgramCache]: Analyzing trace with hash -925514260, now seen corresponding path program 1 times [2024-10-14 07:43:06,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:43:06,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024520943] [2024-10-14 07:43:06,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:43:06,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:43:06,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:43:06,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:43:06,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 07:43:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:43:07,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 07:43:07,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:43:16,282 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)