./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-27.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 2c2af28b30594a303b4a65740aef2a04b7045dd70537212db37e354550d3a44c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:33:10,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:33:10,228 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:33:10,234 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:33:10,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:33:10,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:33:10,263 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:33:10,264 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:33:10,264 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:33:10,270 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:33:10,270 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:33:10,270 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:33:10,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:33:10,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:33:10,271 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:33:10,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:33:10,272 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:33:10,272 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:33:10,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:33:10,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:33:10,273 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:33:10,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:33:10,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:33:10,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:33:10,274 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:33:10,275 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:33:10,275 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:33:10,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:33:10,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:33:10,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:33:10,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:33:10,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:33:10,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:33:10,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:33:10,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:33:10,278 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:33:10,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:33:10,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:33:10,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:33:10,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:33:10,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:33:10,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:33:10,279 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 -> 2c2af28b30594a303b4a65740aef2a04b7045dd70537212db37e354550d3a44c [2024-11-08 19:33:10,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:33:10,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:33:10,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:33:10,499 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:33:10,499 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:33:10,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-27.i [2024-11-08 19:33:11,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:33:12,066 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:33:12,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-27.i [2024-11-08 19:33:12,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66559b755/abf0442ca27244a0804347e692cc25aa/FLAGee0ca0bb4 [2024-11-08 19:33:12,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66559b755/abf0442ca27244a0804347e692cc25aa [2024-11-08 19:33:12,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:33:12,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:33:12,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:33:12,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:33:12,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:33:12,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e0184f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12, skipping insertion in model container [2024-11-08 19:33:12,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:33:12,619 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-27.i[913,926] [2024-11-08 19:33:12,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:33:12,688 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:33:12,697 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-27.i[913,926] [2024-11-08 19:33:12,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:33:12,801 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:33:12,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12 WrapperNode [2024-11-08 19:33:12,808 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:33:12,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:33:12,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:33:12,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:33:12,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,853 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2024-11-08 19:33:12,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:33:12,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:33:12,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:33:12,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:33:12,874 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,897 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:33:12,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,906 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:33:12,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:33:12,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:33:12,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:33:12,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (1/1) ... [2024-11-08 19:33:12,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:33:12,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:33:12,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:33:12,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:33:12,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:33:12,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:33:12,983 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:33:12,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:33:12,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:33:12,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:33:13,051 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:33:13,054 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:33:13,335 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-08 19:33:13,335 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:33:13,346 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:33:13,346 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:33:13,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:33:13 BoogieIcfgContainer [2024-11-08 19:33:13,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:33:13,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:33:13,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:33:13,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:33:13,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:33:12" (1/3) ... [2024-11-08 19:33:13,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4037e534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:33:13, skipping insertion in model container [2024-11-08 19:33:13,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:12" (2/3) ... [2024-11-08 19:33:13,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4037e534 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:33:13, skipping insertion in model container [2024-11-08 19:33:13,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:33:13" (3/3) ... [2024-11-08 19:33:13,353 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-27.i [2024-11-08 19:33:13,365 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:33:13,365 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:33:13,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:33:13,416 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;@73ddd62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:33:13,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:33:13,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 19:33:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 19:33:13,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:13,430 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:33:13,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:13,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:13,434 INFO L85 PathProgramCache]: Analyzing trace with hash -979549751, now seen corresponding path program 1 times [2024-11-08 19:33:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:33:13,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756816577] [2024-11-08 19:33:13,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:13,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:33:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:33:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:33:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:33:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:33:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:33:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:33:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:33:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 19:33:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:33:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:33:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:33:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:33:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:33:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:33:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:33:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:33:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:33:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:33:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:33:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:33:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:33:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:33:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:33:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 19:33:13,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:33:13,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756816577] [2024-11-08 19:33:13,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756816577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:33:13,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:33:13,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:33:13,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858387055] [2024-11-08 19:33:13,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:33:13,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:33:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:33:13,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:33:13,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:33:13,849 INFO L87 Difference]: Start difference. First operand has 75 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 19:33:13,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:33:13,880 INFO L93 Difference]: Finished difference Result 143 states and 246 transitions. [2024-11-08 19:33:13,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:33:13,882 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 152 [2024-11-08 19:33:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:33:13,890 INFO L225 Difference]: With dead ends: 143 [2024-11-08 19:33:13,890 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 19:33:13,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:33:13,898 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:33:13,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:33:13,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 19:33:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 19:33:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 19:33:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 107 transitions. [2024-11-08 19:33:13,947 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 107 transitions. Word has length 152 [2024-11-08 19:33:13,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:33:13,949 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 107 transitions. [2024-11-08 19:33:13,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 19:33:13,950 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 107 transitions. [2024-11-08 19:33:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-08 19:33:13,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:13,954 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:33:13,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:33:13,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:13,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:13,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1098791121, now seen corresponding path program 1 times [2024-11-08 19:33:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:33:13,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144774497] [2024-11-08 19:33:13,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:13,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:33:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:33:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:33:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:33:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:33:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:33:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:33:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:33:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 19:33:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:33:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:33:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:33:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:33:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:33:14,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:33:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:33:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:33:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:33:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:33:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:33:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:33:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:33:14,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:33:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:33:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 19:33:14,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:33:14,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144774497] [2024-11-08 19:33:14,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144774497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:33:14,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:33:14,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:33:14,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705632655] [2024-11-08 19:33:14,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:33:14,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:33:14,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:33:14,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:33:14,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:33:14,231 INFO L87 Difference]: Start difference. First operand 71 states and 107 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:33:14,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:33:14,280 INFO L93 Difference]: Finished difference Result 161 states and 242 transitions. [2024-11-08 19:33:14,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:33:14,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 152 [2024-11-08 19:33:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:33:14,282 INFO L225 Difference]: With dead ends: 161 [2024-11-08 19:33:14,282 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 19:33:14,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:33:14,284 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 31 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:33:14,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 191 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:33:14,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 19:33:14,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 79. [2024-11-08 19:33:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.3773584905660377) internal successors, (73), 53 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 19:33:14,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-11-08 19:33:14,303 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 152 [2024-11-08 19:33:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:33:14,304 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-11-08 19:33:14,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:33:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-11-08 19:33:14,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 19:33:14,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:14,307 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:33:14,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:33:14,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:14,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:14,308 INFO L85 PathProgramCache]: Analyzing trace with hash 136874633, now seen corresponding path program 1 times [2024-11-08 19:33:14,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:33:14,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680178460] [2024-11-08 19:33:14,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:14,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:33:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:33:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:33:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:33:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:33:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:33:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 19:33:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 19:33:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 19:33:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 19:33:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 19:33:14,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 19:33:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 19:33:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 19:33:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 19:33:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 19:33:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 19:33:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 19:33:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 19:33:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 19:33:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:33:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 19:33:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:33:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:33:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 19:33:14,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:33:14,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680178460] [2024-11-08 19:33:14,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680178460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:33:14,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:33:14,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:33:14,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087542217] [2024-11-08 19:33:14,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:33:14,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:33:14,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:33:14,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:33:14,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:33:14,496 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:33:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:33:14,543 INFO L93 Difference]: Finished difference Result 170 states and 257 transitions. [2024-11-08 19:33:14,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:33:14,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-08 19:33:14,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:33:14,547 INFO L225 Difference]: With dead ends: 170 [2024-11-08 19:33:14,547 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 19:33:14,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:33:14,550 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 29 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:33:14,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 204 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:33:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 19:33:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-11-08 19:33:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 19:33:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-11-08 19:33:14,562 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 153 [2024-11-08 19:33:14,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:33:14,562 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-11-08 19:33:14,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:33:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-11-08 19:33:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-08 19:33:14,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:14,566 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:33:14,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:33:14,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:14,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:14,567 INFO L85 PathProgramCache]: Analyzing trace with hash 241508969, now seen corresponding path program 1 times [2024-11-08 19:33:14,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:33:14,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974264596] [2024-11-08 19:33:14,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:14,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:33:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:33:14,698 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:33:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:33:14,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:33:14,798 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:33:14,799 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:33:14,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:33:14,802 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 19:33:14,868 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:33:14,870 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:33:14 BoogieIcfgContainer [2024-11-08 19:33:14,870 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:33:14,871 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:33:14,871 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:33:14,871 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:33:14,871 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:33:13" (3/4) ... [2024-11-08 19:33:14,873 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:33:14,874 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:33:14,875 INFO L158 Benchmark]: Toolchain (without parser) took 2406.70ms. Allocated memory was 188.7MB in the beginning and 247.5MB in the end (delta: 58.7MB). Free memory was 123.0MB in the beginning and 172.1MB in the end (delta: -49.1MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-11-08 19:33:14,875 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 188.7MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:33:14,875 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.42ms. Allocated memory is still 188.7MB. Free memory was 122.8MB in the beginning and 161.1MB in the end (delta: -38.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2024-11-08 19:33:14,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.45ms. Allocated memory is still 188.7MB. Free memory was 161.1MB in the beginning and 158.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:33:14,876 INFO L158 Benchmark]: Boogie Preprocessor took 55.21ms. Allocated memory is still 188.7MB. Free memory was 158.6MB in the beginning and 155.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:33:14,876 INFO L158 Benchmark]: RCFGBuilder took 437.26ms. Allocated memory is still 188.7MB. Free memory was 155.0MB in the beginning and 134.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 19:33:14,877 INFO L158 Benchmark]: TraceAbstraction took 1521.95ms. Allocated memory was 188.7MB in the beginning and 247.5MB in the end (delta: 58.7MB). Free memory was 134.1MB in the beginning and 172.1MB in the end (delta: -38.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-08 19:33:14,877 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 247.5MB. Free memory is still 172.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:33:14,879 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.22ms. Allocated memory is still 188.7MB. Free memory is still 156.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.42ms. Allocated memory is still 188.7MB. Free memory was 122.8MB in the beginning and 161.1MB in the end (delta: -38.3MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.45ms. Allocated memory is still 188.7MB. Free memory was 161.1MB in the beginning and 158.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.21ms. Allocated memory is still 188.7MB. Free memory was 158.6MB in the beginning and 155.0MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 437.26ms. Allocated memory is still 188.7MB. Free memory was 155.0MB in the beginning and 134.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1521.95ms. Allocated memory was 188.7MB in the beginning and 247.5MB in the end (delta: 58.7MB). Free memory was 134.1MB in the beginning and 172.1MB in the end (delta: -38.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 247.5MB. Free memory is still 172.1MB. 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 someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryArithmeticFLOAToperation at line 49. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] unsigned long int var_1_9 = 128; [L31] signed short int var_1_10 = -50; [L32] unsigned long int var_1_11 = 8; [L33] unsigned char var_1_12 = 32; [L34] float var_1_13 = 15.625; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 0; [L37] unsigned char var_1_16 = 1; [L38] unsigned char var_1_17 = 1; [L39] unsigned long int var_1_18 = 128; [L40] unsigned char var_1_19 = 0; [L41] unsigned char var_1_20 = 8; [L42] unsigned short int var_1_21 = 16; [L43] unsigned short int var_1_22 = 128; VAL [isInitial=0, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=0, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L94] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L94] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L95] var_1_4 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L96] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L97] var_1_5 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L98] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1, var_1_9=128] [L99] var_1_6 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1, var_1_9=128] [L100] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1, var_1_9=128] [L101] var_1_7 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=128] [L102] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=128] [L103] var_1_9 = __VERIFIER_nondet_ulong() [L104] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L104] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L105] CALL assume_abort_if_not(var_1_9 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L105] RET assume_abort_if_not(var_1_9 <= 4294967294) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L106] var_1_11 = __VERIFIER_nondet_ulong() [L107] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L107] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L108] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L108] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L109] var_1_13 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L110] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L111] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L111] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L112] var_1_15 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L113] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L114] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L114] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L115] var_1_16 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L116] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L117] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L117] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L118] var_1_17 = __VERIFIER_nondet_uchar() [L119] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L119] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L120] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L120] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=128, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L121] var_1_18 = __VERIFIER_nondet_ulong() [L122] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L122] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L123] CALL assume_abort_if_not(var_1_18 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L123] RET assume_abort_if_not(var_1_18 <= 4294967295) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L124] var_1_19 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L125] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L126] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L126] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L139] RET updateVariables() [L140] CALL step() [L47] COND TRUE var_1_2 || var_1_3 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L48] COND TRUE var_1_2 || var_1_3 [L49] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1, var_1_9=-2147483647] [L56] COND FALSE !(var_1_6 > (- var_1_7)) [L61] var_1_8 = var_1_9 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=-2147483647, var_1_9=-2147483647] [L63] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=-2147483647, var_1_9=-2147483647] [L63] COND FALSE !((var_1_9 + var_1_8) > (2u >> var_1_11)) [L70] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L71] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=-2147483647, var_1_9=-2147483647] [L73] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=-2147483647, var_1_9=-2147483647] [L84] var_1_20 = var_1_11 [L85] var_1_21 = 8 [L86] var_1_22 = var_1_12 VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=-2147483647, var_1_9=-2147483647] [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR (((var_1_2 || var_1_3) ? ((var_1_2 || var_1_3) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_9)))) && (((var_1_9 + var_1_8) > (2u >> var_1_11)) ? ((var_1_8 != var_1_9) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=-2147483647, var_1_9=-2147483647] [L131-L132] return ((((((((var_1_2 || var_1_3) ? ((var_1_2 || var_1_3) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_9)))) && (((var_1_9 + var_1_8) > (2u >> var_1_11)) ? ((var_1_8 != var_1_9) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12))) >= var_1_18) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_12)) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=4294967295, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=-2147483647, var_1_9=-2147483647] [L19] reach_error() VAL [isInitial=1, var_1_10=-50, var_1_11=4294967296, var_1_12=4294967296, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_18=4294967295, var_1_19=0, var_1_20=4294967296, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=-2147483647, var_1_9=-2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 502 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 178 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 324 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 610 NumberOfCodeBlocks, 610 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3312/3312 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 19:33:14,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-27.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 2c2af28b30594a303b4a65740aef2a04b7045dd70537212db37e354550d3a44c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 19:33:17,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:33:17,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:33:17,127 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:33:17,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:33:17,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:33:17,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:33:17,158 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:33:17,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:33:17,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:33:17,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:33:17,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:33:17,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:33:17,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:33:17,164 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:33:17,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:33:17,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:33:17,164 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:33:17,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:33:17,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:33:17,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:33:17,165 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:33:17,165 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:33:17,166 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:33:17,166 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:33:17,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:33:17,166 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:33:17,166 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:33:17,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:33:17,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:33:17,167 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:33:17,167 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:33:17,167 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:33:17,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:33:17,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:33:17,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:33:17,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:33:17,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:33:17,168 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:33:17,168 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:33:17,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:33:17,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:33:17,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:33:17,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:33:17,169 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 -> 2c2af28b30594a303b4a65740aef2a04b7045dd70537212db37e354550d3a44c [2024-11-08 19:33:17,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:33:17,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:33:17,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:33:17,474 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:33:17,478 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:33:17,479 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-27.i [2024-11-08 19:33:18,810 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:33:19,052 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:33:19,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-27.i [2024-11-08 19:33:19,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eab0f91e6/e5cde3d6f18247d38f7f48a6f1f7582e/FLAG11b002192 [2024-11-08 19:33:19,079 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eab0f91e6/e5cde3d6f18247d38f7f48a6f1f7582e [2024-11-08 19:33:19,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:33:19,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:33:19,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:33:19,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:33:19,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:33:19,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,089 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d50d0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19, skipping insertion in model container [2024-11-08 19:33:19,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:33:19,271 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-27.i[913,926] [2024-11-08 19:33:19,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:33:19,341 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:33:19,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-27.i[913,926] [2024-11-08 19:33:19,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:33:19,393 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:33:19,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19 WrapperNode [2024-11-08 19:33:19,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:33:19,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:33:19,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:33:19,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:33:19,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,478 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-08 19:33:19,478 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:33:19,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:33:19,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:33:19,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:33:19,489 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,511 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 19:33:19,512 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,539 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:33:19,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:33:19,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:33:19,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:33:19,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (1/1) ... [2024-11-08 19:33:19,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:33:19,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:33:19,574 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:33:19,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:33:19,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:33:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:33:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:33:19,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:33:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:33:19,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:33:19,684 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:33:19,686 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:33:24,729 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-08 19:33:24,730 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:33:24,739 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:33:24,740 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:33:24,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:33:24 BoogieIcfgContainer [2024-11-08 19:33:24,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:33:24,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:33:24,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:33:24,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:33:24,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:33:19" (1/3) ... [2024-11-08 19:33:24,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed93476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:33:24, skipping insertion in model container [2024-11-08 19:33:24,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:33:19" (2/3) ... [2024-11-08 19:33:24,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ed93476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:33:24, skipping insertion in model container [2024-11-08 19:33:24,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:33:24" (3/3) ... [2024-11-08 19:33:24,747 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-27.i [2024-11-08 19:33:24,759 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:33:24,759 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:33:24,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:33:24,807 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;@56c0e714, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:33:24,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:33:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 19:33:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 19:33:24,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:24,821 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:33:24,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:24,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:24,825 INFO L85 PathProgramCache]: Analyzing trace with hash 184450689, now seen corresponding path program 1 times [2024-11-08 19:33:24,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:33:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034041116] [2024-11-08 19:33:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:24,835 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:33:24,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:33:24,838 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:33:24,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 19:33:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:25,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:33:25,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:33:25,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2024-11-08 19:33:25,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:33:25,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:33:25,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034041116] [2024-11-08 19:33:25,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034041116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:33:25,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:33:25,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:33:25,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537391934] [2024-11-08 19:33:25,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:33:25,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:33:25,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:33:25,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:33:25,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:33:25,348 INFO L87 Difference]: Start difference. First operand has 68 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 42 states have internal predecessors, (56), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 19:33:25,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:33:25,367 INFO L93 Difference]: Finished difference Result 129 states and 226 transitions. [2024-11-08 19:33:25,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:33:25,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 149 [2024-11-08 19:33:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:33:25,375 INFO L225 Difference]: With dead ends: 129 [2024-11-08 19:33:25,375 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 19:33:25,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:33:25,380 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:33:25,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:33:25,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 19:33:25,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-08 19:33:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 19:33:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 97 transitions. [2024-11-08 19:33:25,418 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 97 transitions. Word has length 149 [2024-11-08 19:33:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:33:25,419 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 97 transitions. [2024-11-08 19:33:25,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 19:33:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 97 transitions. [2024-11-08 19:33:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-08 19:33:25,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:25,421 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:33:25,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 19:33:25,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:33:25,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:25,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1223697529, now seen corresponding path program 1 times [2024-11-08 19:33:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:33:25,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450154979] [2024-11-08 19:33:25,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:25,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:33:25,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:33:25,630 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:33:25,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 19:33:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:25,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:33:25,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:33:26,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 19:33:26,017 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:33:26,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:33:26,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450154979] [2024-11-08 19:33:26,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450154979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:33:26,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:33:26,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:33:26,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572487106] [2024-11-08 19:33:26,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:33:26,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:33:26,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:33:26,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:33:26,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:33:26,020 INFO L87 Difference]: Start difference. First operand 64 states and 97 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:33:29,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:33:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:33:29,517 INFO L93 Difference]: Finished difference Result 140 states and 212 transitions. [2024-11-08 19:33:29,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:33:29,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 149 [2024-11-08 19:33:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:33:29,546 INFO L225 Difference]: With dead ends: 140 [2024-11-08 19:33:29,546 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 19:33:29,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:33:29,547 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 22 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 19:33:29,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 172 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 19:33:29,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 19:33:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2024-11-08 19:33:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 19:33:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 108 transitions. [2024-11-08 19:33:29,562 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 108 transitions. Word has length 149 [2024-11-08 19:33:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:33:29,564 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 108 transitions. [2024-11-08 19:33:29,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:33:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 108 transitions. [2024-11-08 19:33:29,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 19:33:29,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:29,566 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:33:29,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 19:33:29,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:33:29,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:29,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash 281812512, now seen corresponding path program 1 times [2024-11-08 19:33:29,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:33:29,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333903661] [2024-11-08 19:33:29,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:29,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:33:29,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:33:29,771 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:33:29,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 19:33:30,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:30,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 19:33:30,130 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:33:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 19:33:30,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:33:30,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:33:30,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333903661] [2024-11-08 19:33:30,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333903661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:33:30,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:33:30,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 19:33:30,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785196080] [2024-11-08 19:33:30,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:33:30,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:33:30,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:33:30,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:33:30,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:33:30,267 INFO L87 Difference]: Start difference. First operand 70 states and 108 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:33:34,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:33:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:33:34,160 INFO L93 Difference]: Finished difference Result 154 states and 232 transitions. [2024-11-08 19:33:34,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:33:34,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2024-11-08 19:33:34,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:33:34,188 INFO L225 Difference]: With dead ends: 154 [2024-11-08 19:33:34,188 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 19:33:34,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 19:33:34,189 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 51 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:33:34,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 185 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-08 19:33:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 19:33:34,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-08 19:33:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.309090909090909) internal successors, (72), 56 states have internal predecessors, (72), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:33:34,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-11-08 19:33:34,205 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 150 [2024-11-08 19:33:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:33:34,208 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-11-08 19:33:34,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 19:33:34,208 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-11-08 19:33:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 19:33:34,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:33:34,210 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:33:34,227 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-11-08 19:33:34,413 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-11-08 19:33:34,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:33:34,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:33:34,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1907830833, now seen corresponding path program 1 times [2024-11-08 19:33:34,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:33:34,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877964440] [2024-11-08 19:33:34,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:34,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:33:34,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:33:34,417 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-11-08 19:33:34,420 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-11-08 19:33:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:34,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 19:33:34,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:33:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 512 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2024-11-08 19:33:37,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:33:38,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:33:38,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877964440] [2024-11-08 19:33:38,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877964440] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:33:38,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [5076709] [2024-11-08 19:33:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:33:38,388 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 19:33:38,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 19:33:38,391 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 19:33:38,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-08 19:33:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:33:39,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 19:33:39,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:33:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 462 proven. 96 refuted. 0 times theorem prover too weak. 546 trivial. 0 not checked. [2024-11-08 19:33:42,922 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 19:34:15,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [5076709] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:34:15,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 19:34:15,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2024-11-08 19:34:15,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22962947] [2024-11-08 19:34:15,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 19:34:15,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 19:34:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:34:15,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 19:34:15,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-08 19:34:15,107 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (40), 4 states have call predecessors, (40), 5 states have return successors, (41), 4 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-08 19:34:21,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:34:25,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:34:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:34:25,527 INFO L93 Difference]: Finished difference Result 177 states and 255 transitions. [2024-11-08 19:34:25,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 19:34:25,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (40), 4 states have call predecessors, (40), 5 states have return successors, (41), 4 states have call predecessors, (41), 4 states have call successors, (41) Word has length 150 [2024-11-08 19:34:25,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:34:25,560 INFO L225 Difference]: With dead ends: 177 [2024-11-08 19:34:25,560 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 19:34:25,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-08 19:34:25,561 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 69 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:34:25,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 209 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-08 19:34:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 19:34:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-11-08 19:34:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 62 states have internal predecessors, (76), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 19:34:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 128 transitions. [2024-11-08 19:34:25,573 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 128 transitions. Word has length 150 [2024-11-08 19:34:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:34:25,573 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 128 transitions. [2024-11-08 19:34:25,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 4 states have call successors, (40), 4 states have call predecessors, (40), 5 states have return successors, (41), 4 states have call predecessors, (41), 4 states have call successors, (41) [2024-11-08 19:34:25,574 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 128 transitions. [2024-11-08 19:34:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-08 19:34:25,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:34:25,575 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:34:25,587 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 (5)] Ended with exit code 0 [2024-11-08 19:34:25,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-08 19:34:25,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 19:34:25,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:34:25,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:34:25,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1170866029, now seen corresponding path program 1 times [2024-11-08 19:34:25,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:34:25,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788168415] [2024-11-08 19:34:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:34:25,981 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 19:34:25,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:34:25,982 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 19:34:25,984 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 (7)] Waiting until timeout for monitored process [2024-11-08 19:34:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:34:26,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 19:34:26,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:34:46,214 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)