./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_variablewrapping_wrapper-sp_file-73.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 e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:21:01,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:21:01,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:21:01,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:21:01,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:21:01,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:21:01,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:21:01,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:21:01,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:21:01,752 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:21:01,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:21:01,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:21:01,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:21:01,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:21:01,754 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:21:01,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:21:01,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:21:01,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:21:01,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:21:01,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:21:01,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:21:01,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:21:01,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:21:01,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:21:01,760 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:21:01,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:21:01,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:21:01,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:21:01,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:21:01,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:21:01,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:21:01,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:21:01,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:21:01,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:21:01,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:21:01,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:21:01,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:21:01,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:21:01,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:21:01,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:21:01,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:21:01,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:21:01,766 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 -> e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 [2024-11-19 01:21:02,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:21:02,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:21:02,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:21:02,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:21:02,044 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:21:02,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-19 01:21:03,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:21:03,764 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:21:03,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-19 01:21:03,775 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e60ab31b/dbb3f21a6a2e4b49916edfee54ce8904/FLAG056692657 [2024-11-19 01:21:03,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e60ab31b/dbb3f21a6a2e4b49916edfee54ce8904 [2024-11-19 01:21:03,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:21:03,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:21:03,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:21:03,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:21:03,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:21:03,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:03" (1/1) ... [2024-11-19 01:21:03,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53198724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:03, skipping insertion in model container [2024-11-19 01:21:03,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:03" (1/1) ... [2024-11-19 01:21:03,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:21:04,033 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_variablewrapping_wrapper-sp_file-73.i[917,930] [2024-11-19 01:21:04,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:21:04,130 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:21:04,144 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_variablewrapping_wrapper-sp_file-73.i[917,930] [2024-11-19 01:21:04,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:21:04,210 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:21:04,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04 WrapperNode [2024-11-19 01:21:04,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:21:04,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:21:04,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:21:04,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:21:04,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,290 INFO L138 Inliner]: procedures = 30, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2024-11-19 01:21:04,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:21:04,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:21:04,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:21:04,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:21:04,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,321 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:21:04,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:21:04,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:21:04,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:21:04,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:21:04,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (1/1) ... [2024-11-19 01:21:04,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:21:04,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:21:04,422 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-19 01:21:04,428 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-19 01:21:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:21:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:21:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:21:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:21:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:21:04,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:21:04,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:21:04,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:21:04,488 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:21:04,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:21:04,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:21:04,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:21:04,656 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:21:04,659 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:21:05,333 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-19 01:21:05,333 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:21:05,352 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:21:05,352 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:21:05,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:05 BoogieIcfgContainer [2024-11-19 01:21:05,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:21:05,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:21:05,356 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:21:05,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:21:05,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:21:03" (1/3) ... [2024-11-19 01:21:05,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8639e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:05, skipping insertion in model container [2024-11-19 01:21:05,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:04" (2/3) ... [2024-11-19 01:21:05,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8639e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:05, skipping insertion in model container [2024-11-19 01:21:05,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:05" (3/3) ... [2024-11-19 01:21:05,363 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-19 01:21:05,380 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:21:05,380 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:21:05,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:21:05,479 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;@1b5d2bd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:21:05,480 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:21:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:21:05,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:05,513 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:05,514 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:05,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:05,521 INFO L85 PathProgramCache]: Analyzing trace with hash -282641606, now seen corresponding path program 1 times [2024-11-19 01:21:05,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:05,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852003661] [2024-11-19 01:21:05,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:05,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-19 01:21:05,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:05,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852003661] [2024-11-19 01:21:05,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852003661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:21:05,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862742932] [2024-11-19 01:21:05,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:05,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:21:05,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:21:05,986 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:21:05,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:21:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:06,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:21:06,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:06,357 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-19 01:21:06,357 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:21:06,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862742932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:06,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:21:06,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:21:06,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49525090] [2024-11-19 01:21:06,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:06,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:21:06,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:06,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:21:06,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:21:06,396 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:06,437 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-19 01:21:06,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:21:06,440 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-19 01:21:06,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:06,448 INFO L225 Difference]: With dead ends: 213 [2024-11-19 01:21:06,448 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:21:06,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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-19 01:21:06,454 INFO L432 NwaCegarLoop]: 155 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, 155 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-19 01:21:06,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:21:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:21:06,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 01:21:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-19 01:21:06,505 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-19 01:21:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:06,507 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-19 01:21:06,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-19 01:21:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:21:06,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:06,513 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:06,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:21:06,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:21:06,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:06,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1163314308, now seen corresponding path program 1 times [2024-11-19 01:21:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:06,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084383838] [2024-11-19 01:21:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:06,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-19 01:21:07,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:07,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084383838] [2024-11-19 01:21:07,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084383838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:21:07,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330942487] [2024-11-19 01:21:07,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:07,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:21:07,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:21:07,229 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:21:07,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:21:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:07,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:21:07,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:07,565 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:21:07,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330942487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:07,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:21:07,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-19 01:21:07,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97819741] [2024-11-19 01:21:07,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:07,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:21:07,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:07,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:21:07,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:21:07,569 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:07,613 INFO L93 Difference]: Finished difference Result 212 states and 311 transitions. [2024-11-19 01:21:07,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:21:07,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-19 01:21:07,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:07,616 INFO L225 Difference]: With dead ends: 212 [2024-11-19 01:21:07,616 INFO L226 Difference]: Without dead ends: 109 [2024-11-19 01:21:07,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:21:07,618 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:07,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:21:07,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-19 01:21:07,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-19 01:21:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-19 01:21:07,630 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-19 01:21:07,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:07,632 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-19 01:21:07,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-19 01:21:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:21:07,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:07,635 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:07,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 01:21:07,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-19 01:21:07,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:07,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:07,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1161467266, now seen corresponding path program 1 times [2024-11-19 01:21:07,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:07,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832793141] [2024-11-19 01:21:07,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:07,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-19 01:21:08,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:08,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832793141] [2024-11-19 01:21:08,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832793141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:21:08,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548462462] [2024-11-19 01:21:08,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:08,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:21:08,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:21:08,116 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:21:08,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 01:21:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:08,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:21:08,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:08,407 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:08,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:21:08,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548462462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:08,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:21:08,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-19 01:21:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16756189] [2024-11-19 01:21:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:08,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:21:08,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:08,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:21:08,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:21:08,411 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:08,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:08,449 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2024-11-19 01:21:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:21:08,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-19 01:21:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:08,451 INFO L225 Difference]: With dead ends: 215 [2024-11-19 01:21:08,451 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 01:21:08,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:21:08,453 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:08,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:21:08,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 01:21:08,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 01:21:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-19 01:21:08,475 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 129 [2024-11-19 01:21:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:08,476 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-19 01:21:08,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-19 01:21:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 01:21:08,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:08,482 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:08,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 01:21:08,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:21:08,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:08,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1991140457, now seen corresponding path program 1 times [2024-11-19 01:21:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:08,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249746601] [2024-11-19 01:21:08,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:08,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:09,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:09,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249746601] [2024-11-19 01:21:09,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249746601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:09,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:09,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:21:09,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833010038] [2024-11-19 01:21:09,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:09,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:21:09,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:09,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:21:09,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:21:09,232 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:09,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:09,587 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2024-11-19 01:21:09,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:21:09,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-19 01:21:09,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:09,590 INFO L225 Difference]: With dead ends: 219 [2024-11-19 01:21:09,591 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 01:21:09,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:21:09,593 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:09,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 493 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:21:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 01:21:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 01:21:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-19 01:21:09,611 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 131 [2024-11-19 01:21:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:09,611 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-19 01:21:09,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:09,613 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-19 01:21:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 01:21:09,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:09,616 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:09,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:21:09,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:09,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:09,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1568438631, now seen corresponding path program 1 times [2024-11-19 01:21:09,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:09,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765607802] [2024-11-19 01:21:09,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:09,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:12,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:12,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765607802] [2024-11-19 01:21:12,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765607802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:12,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:12,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:21:12,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34827600] [2024-11-19 01:21:12,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:12,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:21:12,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:12,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:21:12,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:21:12,239 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-19 01:21:13,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:13,188 INFO L93 Difference]: Finished difference Result 274 states and 394 transitions. [2024-11-19 01:21:13,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:21:13,189 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2024-11-19 01:21:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:13,191 INFO L225 Difference]: With dead ends: 274 [2024-11-19 01:21:13,191 INFO L226 Difference]: Without dead ends: 165 [2024-11-19 01:21:13,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:21:13,193 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 363 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:13,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 369 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:21:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-19 01:21:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2024-11-19 01:21:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2024-11-19 01:21:13,220 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 131 [2024-11-19 01:21:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:13,221 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2024-11-19 01:21:13,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-19 01:21:13,222 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2024-11-19 01:21:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 01:21:13,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:13,224 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:13,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:21:13,224 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:13,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash -557321381, now seen corresponding path program 1 times [2024-11-19 01:21:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:13,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829762295] [2024-11-19 01:21:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:13,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:15,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:15,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829762295] [2024-11-19 01:21:15,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829762295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:15,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:15,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 01:21:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775400181] [2024-11-19 01:21:15,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:15,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 01:21:15,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:15,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 01:21:15,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:21:15,210 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:16,099 INFO L93 Difference]: Finished difference Result 319 states and 467 transitions. [2024-11-19 01:21:16,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:21:16,100 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-19 01:21:16,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:16,102 INFO L225 Difference]: With dead ends: 319 [2024-11-19 01:21:16,102 INFO L226 Difference]: Without dead ends: 196 [2024-11-19 01:21:16,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:21:16,104 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 87 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:16,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 525 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:21:16,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-19 01:21:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2024-11-19 01:21:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 154 states have internal predecessors, (214), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:21:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 274 transitions. [2024-11-19 01:21:16,144 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 274 transitions. Word has length 131 [2024-11-19 01:21:16,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:16,145 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 274 transitions. [2024-11-19 01:21:16,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 274 transitions. [2024-11-19 01:21:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:21:16,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:16,148 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:16,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:21:16,148 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:16,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:16,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1833875789, now seen corresponding path program 1 times [2024-11-19 01:21:16,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:16,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814311952] [2024-11-19 01:21:16,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:16,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:16,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:16,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814311952] [2024-11-19 01:21:16,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814311952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:16,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:16,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:21:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076038029] [2024-11-19 01:21:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:16,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:21:16,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:16,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:21:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:21:16,861 INFO L87 Difference]: Start difference. First operand 187 states and 274 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:17,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:17,479 INFO L93 Difference]: Finished difference Result 351 states and 510 transitions. [2024-11-19 01:21:17,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:21:17,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2024-11-19 01:21:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:17,482 INFO L225 Difference]: With dead ends: 351 [2024-11-19 01:21:17,482 INFO L226 Difference]: Without dead ends: 228 [2024-11-19 01:21:17,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:21:17,483 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 199 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:17,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 456 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:21:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-19 01:21:17,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 187. [2024-11-19 01:21:17,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 154 states have internal predecessors, (214), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:21:17,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 274 transitions. [2024-11-19 01:21:17,512 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 274 transitions. Word has length 132 [2024-11-19 01:21:17,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:17,513 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 274 transitions. [2024-11-19 01:21:17,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:17,513 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 274 transitions. [2024-11-19 01:21:17,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:21:17,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:17,514 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:17,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:21:17,514 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:17,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1449974257, now seen corresponding path program 1 times [2024-11-19 01:21:17,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:17,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781701384] [2024-11-19 01:21:17,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:17,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:19,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:19,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781701384] [2024-11-19 01:21:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781701384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:19,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:19,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:21:19,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959317694] [2024-11-19 01:21:19,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:19,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:21:19,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:19,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:21:19,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:21:19,664 INFO L87 Difference]: Start difference. First operand 187 states and 274 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-19 01:21:20,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:20,103 INFO L93 Difference]: Finished difference Result 317 states and 464 transitions. [2024-11-19 01:21:20,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:21:20,104 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2024-11-19 01:21:20,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:20,106 INFO L225 Difference]: With dead ends: 317 [2024-11-19 01:21:20,107 INFO L226 Difference]: Without dead ends: 194 [2024-11-19 01:21:20,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:21:20,109 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 127 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:20,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 360 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:21:20,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-19 01:21:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 187. [2024-11-19 01:21:20,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 154 states have internal predecessors, (213), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:21:20,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 273 transitions. [2024-11-19 01:21:20,135 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 273 transitions. Word has length 132 [2024-11-19 01:21:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:20,136 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 273 transitions. [2024-11-19 01:21:20,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-19 01:21:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 273 transitions. [2024-11-19 01:21:20,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:21:20,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:20,139 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:20,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:21:20,139 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:20,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:20,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1231119539, now seen corresponding path program 1 times [2024-11-19 01:21:20,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:20,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285548914] [2024-11-19 01:21:20,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:20,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:25,053 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:25,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:21:25,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285548914] [2024-11-19 01:21:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285548914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:25,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:25,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 01:21:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235320115] [2024-11-19 01:21:25,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:25,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 01:21:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:21:25,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 01:21:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:21:25,056 INFO L87 Difference]: Start difference. First operand 187 states and 273 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-19 01:21:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:26,079 INFO L93 Difference]: Finished difference Result 363 states and 526 transitions. [2024-11-19 01:21:26,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:21:26,080 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2024-11-19 01:21:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:26,082 INFO L225 Difference]: With dead ends: 363 [2024-11-19 01:21:26,082 INFO L226 Difference]: Without dead ends: 240 [2024-11-19 01:21:26,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:21:26,084 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 139 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:26,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 470 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:21:26,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-19 01:21:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 196. [2024-11-19 01:21:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 163 states have internal predecessors, (223), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 01:21:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 283 transitions. [2024-11-19 01:21:26,116 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 283 transitions. Word has length 132 [2024-11-19 01:21:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:26,117 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 283 transitions. [2024-11-19 01:21:26,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-19 01:21:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 283 transitions. [2024-11-19 01:21:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:21:26,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:26,118 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:26,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:21:26,119 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:26,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2042779403, now seen corresponding path program 1 times [2024-11-19 01:21:26,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:21:26,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842579585] [2024-11-19 01:21:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:26,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:21:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:21:26,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:21:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:21:26,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:21:26,432 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:21:26,433 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:21:26,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:21:26,438 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:21:26,588 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:21:26,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:21:26 BoogieIcfgContainer [2024-11-19 01:21:26,591 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:21:26,592 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:21:26,592 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:21:26,592 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:21:26,593 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:05" (3/4) ... [2024-11-19 01:21:26,595 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:21:26,596 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:21:26,597 INFO L158 Benchmark]: Toolchain (without parser) took 22802.93ms. Allocated memory was 169.9MB in the beginning and 748.7MB in the end (delta: 578.8MB). Free memory was 113.2MB in the beginning and 339.0MB in the end (delta: -225.8MB). Peak memory consumption was 355.1MB. Max. memory is 16.1GB. [2024-11-19 01:21:26,597 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 169.9MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:21:26,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.24ms. Allocated memory is still 169.9MB. Free memory was 113.2MB in the beginning and 95.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 01:21:26,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.73ms. Allocated memory is still 169.9MB. Free memory was 95.0MB in the beginning and 91.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:21:26,598 INFO L158 Benchmark]: Boogie Preprocessor took 76.82ms. Allocated memory is still 169.9MB. Free memory was 91.5MB in the beginning and 88.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:21:26,598 INFO L158 Benchmark]: RCFGBuilder took 982.62ms. Allocated memory is still 169.9MB. Free memory was 88.0MB in the beginning and 51.0MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-19 01:21:26,599 INFO L158 Benchmark]: TraceAbstraction took 21236.05ms. Allocated memory was 169.9MB in the beginning and 748.7MB in the end (delta: 578.8MB). Free memory was 50.3MB in the beginning and 340.1MB in the end (delta: -289.8MB). Peak memory consumption was 292.2MB. Max. memory is 16.1GB. [2024-11-19 01:21:26,599 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 748.7MB. Free memory was 340.1MB in the beginning and 339.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:21:26,601 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.19ms. Allocated memory is still 169.9MB. Free memory is still 133.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.24ms. Allocated memory is still 169.9MB. Free memory was 113.2MB in the beginning and 95.0MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.73ms. Allocated memory is still 169.9MB. Free memory was 95.0MB in the beginning and 91.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.82ms. Allocated memory is still 169.9MB. Free memory was 91.5MB in the beginning and 88.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 982.62ms. Allocated memory is still 169.9MB. Free memory was 88.0MB in the beginning and 51.0MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 21236.05ms. Allocated memory was 169.9MB in the beginning and 748.7MB in the end (delta: 578.8MB). Free memory was 50.3MB in the beginning and 340.1MB in the end (delta: -289.8MB). Peak memory consumption was 292.2MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 748.7MB. Free memory was 340.1MB in the beginning and 339.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someUnaryDOUBLEoperation at line 42. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L55] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L57] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L58] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L59] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L60] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L61] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L62] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L63] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L64] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L65] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L67] signed char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L68] signed long int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L69] float last_1_WrapperStruct00_var_1_12 = 15.75; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=0, last_1_WrapperStruct00_var_1_12=63/4] [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] CALL updateLastVariables() [L131] EXPR WrapperStruct00.var_1_12 [L131] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L141] RET updateLastVariables() [L142] CALL updateVariables() [L105] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L108] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L110] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L113] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L116] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_13 [L117] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_13 [L117] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L121] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L126] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L127] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L142] RET updateVariables() [L143] CALL step() [L73] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L73] COND FALSE !((*(WrapperStruct00_var_1_6_Pointer))) [L76] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L76] COND FALSE !(last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) [L80] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L80] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L81] COND FALSE !((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] signed long int stepLocal_0 = ((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))); [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4, stepLocal_0=50] [L95] COND TRUE (*(WrapperStruct00_var_1_8_Pointer)) <= stepLocal_0 [L96] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L96] COND TRUE ! (*(WrapperStruct00_var_1_6_Pointer)) [L97] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L97] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L102] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L102] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L143] RET step() [L144] CALL, EXPR property() [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 [L134] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L134] EXPR (! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134-L135] return ((((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.0s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 917 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 916 mSDsluCounter, 3724 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2600 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2471 IncrementalHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 1124 mSDtfsCounter, 2471 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 435 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=9, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 141 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 1695 NumberOfCodeBlocks, 1695 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1551 ConstructedInterpolants, 0 QuantifiedInterpolants, 11961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1582 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 4928/5040 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-19 01:21:26,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_variablewrapping_wrapper-sp_file-73.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 e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:21:29,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:21:29,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:21:29,221 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:21:29,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:21:29,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:21:29,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:21:29,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:21:29,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:21:29,255 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:21:29,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:21:29,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:21:29,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:21:29,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:21:29,259 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:21:29,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:21:29,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:21:29,260 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:21:29,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:21:29,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:21:29,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:21:29,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:21:29,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:21:29,265 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:21:29,266 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:21:29,266 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:21:29,266 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:21:29,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:21:29,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:21:29,267 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:21:29,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:21:29,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:21:29,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:21:29,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:21:29,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:21:29,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:21:29,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:21:29,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:21:29,272 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:21:29,272 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:21:29,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:21:29,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:21:29,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:21:29,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:21:29,273 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 -> e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 [2024-11-19 01:21:29,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:21:29,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:21:29,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:21:29,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:21:29,672 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:21:29,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-19 01:21:31,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:21:31,536 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:21:31,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-19 01:21:31,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d20c8346e/fd6155aa18f541999a2cbb285fef20b4/FLAG1dd795bec [2024-11-19 01:21:31,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d20c8346e/fd6155aa18f541999a2cbb285fef20b4 [2024-11-19 01:21:31,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:21:31,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:21:31,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:21:31,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:21:31,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:21:31,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:31" (1/1) ... [2024-11-19 01:21:31,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547bb253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:31, skipping insertion in model container [2024-11-19 01:21:31,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:21:31" (1/1) ... [2024-11-19 01:21:31,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:21:32,112 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_variablewrapping_wrapper-sp_file-73.i[917,930] [2024-11-19 01:21:32,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:21:32,241 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:21:32,256 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_variablewrapping_wrapper-sp_file-73.i[917,930] [2024-11-19 01:21:32,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:21:32,341 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:21:32,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32 WrapperNode [2024-11-19 01:21:32,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:21:32,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:21:32,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:21:32,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:21:32,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,426 INFO L138 Inliner]: procedures = 37, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2024-11-19 01:21:32,427 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:21:32,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:21:32,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:21:32,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:21:32,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,495 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2024-11-19 01:21:32,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,524 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:21:32,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:21:32,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:21:32,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:21:32,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (1/1) ... [2024-11-19 01:21:32,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:21:32,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:21:32,576 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-19 01:21:32,584 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-19 01:21:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:21:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:21:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:21:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-19 01:21:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-19 01:21:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:21:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:21:32,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:21:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:21:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:21:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:21:32,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:21:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:21:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:21:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:21:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-19 01:21:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-19 01:21:32,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:21:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:21:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:21:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:21:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:21:32,658 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:21:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-19 01:21:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-19 01:21:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:21:32,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:21:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:21:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:21:32,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:21:32,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:21:32,842 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:21:32,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:21:37,279 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-19 01:21:37,280 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:21:37,301 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:21:37,302 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:21:37,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:37 BoogieIcfgContainer [2024-11-19 01:21:37,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:21:37,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:21:37,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:21:37,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:21:37,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:21:31" (1/3) ... [2024-11-19 01:21:37,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640eb4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:37, skipping insertion in model container [2024-11-19 01:21:37,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:21:32" (2/3) ... [2024-11-19 01:21:37,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@640eb4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:21:37, skipping insertion in model container [2024-11-19 01:21:37,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:21:37" (3/3) ... [2024-11-19 01:21:37,311 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-19 01:21:37,330 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:21:37,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:21:37,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:21:37,410 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;@10aec3cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:21:37,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:21:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:21:37,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:37,431 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:37,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:37,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2041388229, now seen corresponding path program 1 times [2024-11-19 01:21:37,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:21:37,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012423225] [2024-11-19 01:21:37,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:37,457 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-19 01:21:37,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:21:37,461 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-19 01:21:37,463 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-19 01:21:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:37,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:21:37,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-19 01:21:37,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:21:37,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:21:37,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012423225] [2024-11-19 01:21:37,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1012423225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:37,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:37,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:21:38,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283551037] [2024-11-19 01:21:38,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:38,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:21:38,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:21:38,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:21:38,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:21:38,036 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:38,077 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-19 01:21:38,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:21:38,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-19 01:21:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:38,090 INFO L225 Difference]: With dead ends: 213 [2024-11-19 01:21:38,091 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:21:38,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-19 01:21:38,098 INFO L432 NwaCegarLoop]: 155 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, 155 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-19 01:21:38,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:21:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:21:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 01:21:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-19 01:21:38,155 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-19 01:21:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:38,156 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-19 01:21:38,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-19 01:21:38,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:21:38,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:38,162 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:38,177 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-19 01:21:38,366 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-19 01:21:38,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:38,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1160715527, now seen corresponding path program 1 times [2024-11-19 01:21:38,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:21:38,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541313994] [2024-11-19 01:21:38,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:38,369 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-19 01:21:38,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:21:38,378 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-19 01:21:38,380 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-19 01:21:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:38,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:21:38,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-19 01:21:38,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:21:38,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:21:38,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541313994] [2024-11-19 01:21:38,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541313994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:38,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:38,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:21:38,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251381346] [2024-11-19 01:21:38,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:38,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:21:38,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:21:38,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:21:38,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:21:38,796 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:38,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:38,910 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-19 01:21:38,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:21:38,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-19 01:21:38,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:38,916 INFO L225 Difference]: With dead ends: 211 [2024-11-19 01:21:38,917 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 01:21:38,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:21:38,921 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:38,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:21:38,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 01:21:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-19 01:21:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-19 01:21:38,946 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-19 01:21:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:38,949 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-19 01:21:38,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:38,950 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-19 01:21:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:21:38,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:38,953 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:38,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:21:39,153 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-19 01:21:39,154 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:39,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:39,155 INFO L85 PathProgramCache]: Analyzing trace with hash 689359177, now seen corresponding path program 1 times [2024-11-19 01:21:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:21:39,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650211981] [2024-11-19 01:21:39,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:39,158 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-19 01:21:39,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:21:39,161 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-19 01:21:39,163 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-19 01:21:39,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:39,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:21:39,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:39,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:21:39,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:21:39,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650211981] [2024-11-19 01:21:39,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650211981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:39,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:39,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:21:39,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516890300] [2024-11-19 01:21:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:39,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:21:39,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:21:39,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:21:39,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:21:39,595 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:39,690 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2024-11-19 01:21:39,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:21:39,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-19 01:21:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:39,696 INFO L225 Difference]: With dead ends: 215 [2024-11-19 01:21:39,696 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 01:21:39,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:21:39,698 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:39,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:21:39,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 01:21:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 01:21:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-19 01:21:39,725 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 129 [2024-11-19 01:21:39,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:39,725 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-19 01:21:39,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-19 01:21:39,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 01:21:39,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:39,728 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:39,742 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-19 01:21:39,928 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-19 01:21:39,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:39,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:39,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1547220764, now seen corresponding path program 1 times [2024-11-19 01:21:39,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:21:39,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449605980] [2024-11-19 01:21:39,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:39,930 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-19 01:21:39,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:21:39,934 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-19 01:21:39,935 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-19 01:21:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:40,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:21:40,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:40,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:21:40,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:21:40,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449605980] [2024-11-19 01:21:40,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449605980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:40,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:40,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:21:40,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170023816] [2024-11-19 01:21:40,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:40,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:21:40,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:21:40,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:21:40,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:21:40,401 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:40,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:40,468 INFO L93 Difference]: Finished difference Result 222 states and 322 transitions. [2024-11-19 01:21:40,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:21:40,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-19 01:21:40,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:40,470 INFO L225 Difference]: With dead ends: 222 [2024-11-19 01:21:40,471 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 01:21:40,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:21:40,472 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:40,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:21:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 01:21:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-19 01:21:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-19 01:21:40,480 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 131 [2024-11-19 01:21:40,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:40,481 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-19 01:21:40,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-19 01:21:40,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 01:21:40,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:40,483 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:40,498 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-19 01:21:40,687 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 [2024-11-19 01:21:40,688 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:40,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash 227786598, now seen corresponding path program 1 times [2024-11-19 01:21:40,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:21:40,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960045764] [2024-11-19 01:21:40,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:40,689 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-19 01:21:40,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:21:40,694 INFO L229 MonitoredProcess]: Starting monitored process 6 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-19 01:21:40,704 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 (6)] Waiting until timeout for monitored process [2024-11-19 01:21:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:41,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:21:41,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:41,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-19 01:21:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-19 01:21:41,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:21:41,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:21:41,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960045764] [2024-11-19 01:21:41,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960045764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:41,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:41,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:21:41,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699697406] [2024-11-19 01:21:41,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:41,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:21:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:21:41,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:21:41,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:21:41,431 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:42,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:21:45,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:45,312 INFO L93 Difference]: Finished difference Result 226 states and 324 transitions. [2024-11-19 01:21:45,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:21:45,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-19 01:21:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:45,315 INFO L225 Difference]: With dead ends: 226 [2024-11-19 01:21:45,315 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 01:21:45,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:21:45,317 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:45,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 438 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-19 01:21:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 01:21:45,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-19 01:21:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:45,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-19 01:21:45,326 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 131 [2024-11-19 01:21:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:45,327 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-19 01:21:45,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:45,327 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-19 01:21:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 01:21:45,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:45,329 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:45,344 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 (6)] Ended with exit code 0 [2024-11-19 01:21:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-19 01:21:45,530 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1395501140, now seen corresponding path program 1 times [2024-11-19 01:21:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:21:45,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [946963334] [2024-11-19 01:21:45,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:45,532 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-19 01:21:45,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:21:45,533 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-19 01:21:45,535 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-19 01:21:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:45,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:21:45,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:46,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-19 01:21:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-19 01:21:46,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:21:46,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:21:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [946963334] [2024-11-19 01:21:46,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [946963334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:46,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:46,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:21:46,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931509643] [2024-11-19 01:21:46,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:46,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:21:46,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:21:46,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:21:46,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:21:46,288 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:47,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:21:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:50,156 INFO L93 Difference]: Finished difference Result 226 states and 322 transitions. [2024-11-19 01:21:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:21:50,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-11-19 01:21:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:50,158 INFO L225 Difference]: With dead ends: 226 [2024-11-19 01:21:50,158 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 01:21:50,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:21:50,160 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 102 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:50,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 434 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-19 01:21:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 01:21:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-19 01:21:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2024-11-19 01:21:50,169 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 133 [2024-11-19 01:21:50,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:50,176 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2024-11-19 01:21:50,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 01:21:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2024-11-19 01:21:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 01:21:50,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:50,182 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:50,202 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 (7)] Ended with exit code 0 [2024-11-19 01:21:50,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-19 01:21:50,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:50,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash 752811686, now seen corresponding path program 1 times [2024-11-19 01:21:50,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:21:50,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033797529] [2024-11-19 01:21:50,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:50,386 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-19 01:21:50,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:21:50,389 INFO L229 MonitoredProcess]: Starting monitored process 8 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-19 01:21:50,391 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 (8)] Waiting until timeout for monitored process [2024-11-19 01:21:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:50,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:21:50,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:50,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-19 01:21:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:50,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:21:50,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:21:50,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033797529] [2024-11-19 01:21:50,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033797529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:50,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:50,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:21:50,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962607783] [2024-11-19 01:21:50,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:50,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:21:50,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:21:50,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:21:50,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:21:50,930 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:52,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:21:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:53,034 INFO L93 Difference]: Finished difference Result 227 states and 322 transitions. [2024-11-19 01:21:53,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:21:53,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-19 01:21:53,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:53,037 INFO L225 Difference]: With dead ends: 227 [2024-11-19 01:21:53,037 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 01:21:53,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:21:53,038 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:53,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 01:21:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 01:21:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-19 01:21:53,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2024-11-19 01:21:53,046 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 135 [2024-11-19 01:21:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:53,047 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2024-11-19 01:21:53,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2024-11-19 01:21:53,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 01:21:53,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:53,049 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:53,061 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 (8)] Ended with exit code 0 [2024-11-19 01:21:53,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-19 01:21:53,250 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1175513512, now seen corresponding path program 1 times [2024-11-19 01:21:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:21:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784713837] [2024-11-19 01:21:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:53,251 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-19 01:21:53,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:21:53,252 INFO L229 MonitoredProcess]: Starting monitored process 9 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-19 01:21:53,253 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 (9)] Waiting until timeout for monitored process [2024-11-19 01:21:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:53,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:21:53,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:53,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:21:53,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 34 [2024-11-19 01:21:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 01:21:53,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:21:53,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:21:53,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784713837] [2024-11-19 01:21:53,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784713837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:21:53,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:21:53,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:21:53,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277789668] [2024-11-19 01:21:53,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:21:53,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:21:53,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:21:53,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:21:53,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:21:53,813 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:55,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 01:21:56,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:21:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:21:58,458 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2024-11-19 01:21:58,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:21:58,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-19 01:21:58,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:21:58,460 INFO L225 Difference]: With dead ends: 229 [2024-11-19 01:21:58,461 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 01:21:58,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:21:58,461 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:21:58,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-19 01:21:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 01:21:58,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-19 01:21:58,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 97 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 01:21:58,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-19 01:21:58,468 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 135 [2024-11-19 01:21:58,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:21:58,469 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-19 01:21:58,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 01:21:58,469 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-19 01:21:58,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-19 01:21:58,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:21:58,471 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:21:58,484 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 (9)] Ended with exit code 0 [2024-11-19 01:21:58,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-19 01:21:58,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:21:58,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:21:58,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1295579430, now seen corresponding path program 1 times [2024-11-19 01:21:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:21:58,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008977542] [2024-11-19 01:21:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:21:58,673 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-19 01:21:58,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:21:58,676 INFO L229 MonitoredProcess]: Starting monitored process 10 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-19 01:21:58,677 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 (10)] Waiting until timeout for monitored process [2024-11-19 01:21:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:21:59,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 01:21:59,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:21:59,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:21:59,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:21:59,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:21:59,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:21:59,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:21:59,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:21:59,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:21:59,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:21:59,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:21:59,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:21:59,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 65 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 42 [2024-11-19 01:21:59,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-11-19 01:22:00,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2024-11-19 01:22:01,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-19 01:22:02,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-19 01:22:03,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-19 01:22:03,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-19 01:22:04,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-11-19 01:22:05,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-19 01:22:05,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-19 01:22:06,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2024-11-19 01:22:06,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2024-11-19 01:22:06,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:22:06,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 34 [2024-11-19 01:22:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 24 proven. 264 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-19 01:22:06,699 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:22:07,173 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:22:07,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008977542] [2024-11-19 01:22:07,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008977542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:22:07,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [376853412] [2024-11-19 01:22:07,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:22:07,174 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:22:07,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:22:07,177 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:22:07,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-19 01:22:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:22:08,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 01:22:08,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:22:09,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:22:09,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 76 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2024-11-19 01:22:09,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 79 [2024-11-19 01:22:10,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 87 [2024-11-19 01:22:13,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91