./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.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-24.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 eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:15:23,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:15:23,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:15:23,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:15:23,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:15:23,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:15:23,208 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:15:23,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:15:23,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:15:23,211 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:15:23,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:15:23,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:15:23,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:15:23,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:15:23,214 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:15:23,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:15:23,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:15:23,215 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:15:23,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:15:23,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:15:23,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:15:23,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:15:23,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:15:23,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:15:23,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:15:23,221 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:15:23,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:15:23,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:15:23,222 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:15:23,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:15:23,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:15:23,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:15:23,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:15:23,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:15:23,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:15:23,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:15:23,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:15:23,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:15:23,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:15:23,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:15:23,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:15:23,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:15:23,237 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 -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2024-11-19 01:15:23,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:15:23,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:15:23,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:15:23,550 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:15:23,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:15:23,552 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-24.i [2024-11-19 01:15:25,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:15:25,240 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:15:25,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-19 01:15:25,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daabe6a49/b88e12bc01f948fabc893cd5143203c1/FLAGb65848e0d [2024-11-19 01:15:25,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daabe6a49/b88e12bc01f948fabc893cd5143203c1 [2024-11-19 01:15:25,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:15:25,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:15:25,281 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:15:25,281 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:15:25,287 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:15:25,287 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f886cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25, skipping insertion in model container [2024-11-19 01:15:25,288 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:15:25,507 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-24.i[917,930] [2024-11-19 01:15:25,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:15:25,582 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:15:25,595 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-24.i[917,930] [2024-11-19 01:15:25,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:15:25,694 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:15:25,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25 WrapperNode [2024-11-19 01:15:25,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:15:25,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:15:25,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:15:25,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:15:25,708 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:15:25" (1/1) ... [2024-11-19 01:15:25,728 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:15:25" (1/1) ... [2024-11-19 01:15:25,780 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 471 [2024-11-19 01:15:25,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:15:25,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:15:25,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:15:25,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:15:25,792 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,810 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:15:25,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,842 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:15:25,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:15:25,852 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:15:25,852 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:15:25,853 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25" (1/1) ... [2024-11-19 01:15:25,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:15:25,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:15:25,899 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:15:25,906 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:15:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:15:25,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:15:25,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:15:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:15:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:15:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:15:25,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:15:25,963 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:15:25,963 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:15:25,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:15:25,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:15:25,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:15:26,122 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:15:26,124 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:15:26,680 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-19 01:15:26,680 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:15:26,697 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:15:26,698 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:15:26,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:15:26 BoogieIcfgContainer [2024-11-19 01:15:26,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:15:26,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:15:26,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:15:26,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:15:26,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:15:25" (1/3) ... [2024-11-19 01:15:26,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ac8e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:15:26, skipping insertion in model container [2024-11-19 01:15:26,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:25" (2/3) ... [2024-11-19 01:15:26,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ac8e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:15:26, skipping insertion in model container [2024-11-19 01:15:26,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:15:26" (3/3) ... [2024-11-19 01:15:26,710 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-19 01:15:26,728 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:15:26,729 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:15:26,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:15:26,795 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;@6fd48151, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:15:26,795 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:15:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 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:15:26,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:15:26,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:26,811 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] [2024-11-19 01:15:26,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:26,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:26,816 INFO L85 PathProgramCache]: Analyzing trace with hash 341014851, now seen corresponding path program 1 times [2024-11-19 01:15:26,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:26,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280000198] [2024-11-19 01:15:26,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:26,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:27,302 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:15:27,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:27,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280000198] [2024-11-19 01:15:27,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280000198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:15:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558730952] [2024-11-19 01:15:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:27,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:15:27,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:15:27,306 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:15:27,307 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:15:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:27,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:15:27,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:15:27,616 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:15:27,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:15:27,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558730952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:27,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:15:27,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:15:27,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357784067] [2024-11-19 01:15:27,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:27,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:15:27,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:27,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:15:27,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:15:27,661 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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:15:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:27,693 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-19 01:15:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:15:27,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 124 [2024-11-19 01:15:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:27,701 INFO L225 Difference]: With dead ends: 195 [2024-11-19 01:15:27,701 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 01:15:27,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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:15:27,707 INFO L432 NwaCegarLoop]: 139 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, 139 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:15:27,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:15:27,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 01:15:27,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 01:15:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 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:15:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-19 01:15:27,744 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-19 01:15:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:27,745 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-19 01:15:27,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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:15:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-19 01:15:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:15:27,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:27,752 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] [2024-11-19 01:15:27,770 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:15:27,953 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:15:27,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:27,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:27,955 INFO L85 PathProgramCache]: Analyzing trace with hash -984360163, now seen corresponding path program 1 times [2024-11-19 01:15:27,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:27,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981644304] [2024-11-19 01:15:27,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:27,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:28,281 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:15:28,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:28,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981644304] [2024-11-19 01:15:28,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981644304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:28,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:28,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:15:28,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116109072] [2024-11-19 01:15:28,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:28,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:15:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:28,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:15:28,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:15:28,286 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:15:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:28,336 INFO L93 Difference]: Finished difference Result 193 states and 278 transitions. [2024-11-19 01:15:28,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:15:28,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2024-11-19 01:15:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:28,340 INFO L225 Difference]: With dead ends: 193 [2024-11-19 01:15:28,340 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 01:15:28,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:15:28,342 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 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:15:28,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:15:28,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 01:15:28,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-19 01:15:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 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:15:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-19 01:15:28,371 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-19 01:15:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:28,372 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-19 01:15:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:15:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-19 01:15:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:15:28,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:28,375 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] [2024-11-19 01:15:28,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:15:28,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:28,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:28,377 INFO L85 PathProgramCache]: Analyzing trace with hash -140354661, now seen corresponding path program 1 times [2024-11-19 01:15:28,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:28,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709213919] [2024-11-19 01:15:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:28,590 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:15:28,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:28,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709213919] [2024-11-19 01:15:28,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709213919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:28,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:28,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:15:28,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284425183] [2024-11-19 01:15:28,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:28,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:15:28,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:28,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:15:28,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:15:28,598 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:15:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:28,619 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-19 01:15:28,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:15:28,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 124 [2024-11-19 01:15:28,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:28,622 INFO L225 Difference]: With dead ends: 196 [2024-11-19 01:15:28,623 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 01:15:28,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:15:28,626 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:28,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:15:28,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 01:15:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-19 01:15:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 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:15:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-19 01:15:28,642 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 124 [2024-11-19 01:15:28,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:28,647 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-19 01:15:28,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:15:28,648 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-19 01:15:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:15:28,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:28,652 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] [2024-11-19 01:15:28,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:15:28,653 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:28,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:28,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1945792995, now seen corresponding path program 1 times [2024-11-19 01:15:28,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:28,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150508865] [2024-11-19 01:15:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:28,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:28,844 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:15:28,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:28,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150508865] [2024-11-19 01:15:28,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150508865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:28,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:28,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:15:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071611833] [2024-11-19 01:15:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:28,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:15:28,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:28,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:15:28,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:15:28,850 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:15:28,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:28,877 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-19 01:15:28,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:15:28,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 124 [2024-11-19 01:15:28,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:28,880 INFO L225 Difference]: With dead ends: 198 [2024-11-19 01:15:28,882 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 01:15:28,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:15:28,884 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:28,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:15:28,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 01:15:28,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-19 01:15:28,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 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:15:28,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-19 01:15:28,901 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2024-11-19 01:15:28,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:28,901 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-19 01:15:28,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:15:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-19 01:15:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:15:28,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:28,908 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] [2024-11-19 01:15:28,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:15:28,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:28,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1328105947, now seen corresponding path program 1 times [2024-11-19 01:15:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749980598] [2024-11-19 01:15:28,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:28,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:29,139 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:15:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:29,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749980598] [2024-11-19 01:15:29,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749980598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:29,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:29,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:15:29,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556362924] [2024-11-19 01:15:29,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:29,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:15:29,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:29,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:15:29,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:15:29,143 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:15:29,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:29,170 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-11-19 01:15:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:15:29,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2024-11-19 01:15:29,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:29,172 INFO L225 Difference]: With dead ends: 202 [2024-11-19 01:15:29,173 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 01:15:29,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:15:29,175 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:29,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:15:29,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 01:15:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-19 01:15:29,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 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:15:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-19 01:15:29,189 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-19 01:15:29,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:29,189 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-19 01:15:29,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:15:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-19 01:15:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:15:29,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:29,191 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] [2024-11-19 01:15:29,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:15:29,193 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:29,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:29,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2008164317, now seen corresponding path program 1 times [2024-11-19 01:15:29,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:29,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423907945] [2024-11-19 01:15:29,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:29,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:29,368 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:15:29,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:29,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423907945] [2024-11-19 01:15:29,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423907945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:29,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:29,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:15:29,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316652877] [2024-11-19 01:15:29,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:29,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:15:29,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:29,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:15:29,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:15:29,375 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:15:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:29,405 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-19 01:15:29,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:15:29,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2024-11-19 01:15:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:29,407 INFO L225 Difference]: With dead ends: 206 [2024-11-19 01:15:29,409 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:15:29,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:15:29,410 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:29,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:15:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:15:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-19 01:15:29,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 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:15:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-19 01:15:29,423 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-19 01:15:29,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:29,423 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-19 01:15:29,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:15:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-19 01:15:29,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:15:29,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:29,427 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] [2024-11-19 01:15:29,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:15:29,427 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:29,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash -511795617, now seen corresponding path program 1 times [2024-11-19 01:15:29,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:29,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914054074] [2024-11-19 01:15:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:29,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:29,578 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:15:29,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:29,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914054074] [2024-11-19 01:15:29,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914054074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:29,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:29,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:15:29,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101353035] [2024-11-19 01:15:29,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:29,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:15:29,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:29,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:15:29,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:15:29,582 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:15:29,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:29,607 INFO L93 Difference]: Finished difference Result 210 states and 295 transitions. [2024-11-19 01:15:29,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:15:29,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2024-11-19 01:15:29,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:29,609 INFO L225 Difference]: With dead ends: 210 [2024-11-19 01:15:29,610 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 01:15:29,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:15:29,611 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 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:15:29,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:15:29,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 01:15:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-19 01:15:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 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:15:29,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-11-19 01:15:29,618 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2024-11-19 01:15:29,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:29,618 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-11-19 01:15:29,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:15:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-11-19 01:15:29,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:15:29,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:29,620 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] [2024-11-19 01:15:29,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:15:29,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:29,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:29,625 INFO L85 PathProgramCache]: Analyzing trace with hash -509948575, now seen corresponding path program 1 times [2024-11-19 01:15:29,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:29,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222394232] [2024-11-19 01:15:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:29,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:30,224 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:15:30,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222394232] [2024-11-19 01:15:30,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222394232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:30,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:30,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:15:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471928954] [2024-11-19 01:15:30,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:30,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:15:30,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:15:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:15:30,230 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:15:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:30,597 INFO L93 Difference]: Finished difference Result 263 states and 366 transitions. [2024-11-19 01:15:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:15:30,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 124 [2024-11-19 01:15:30,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:30,600 INFO L225 Difference]: With dead ends: 263 [2024-11-19 01:15:30,601 INFO L226 Difference]: Without dead ends: 159 [2024-11-19 01:15:30,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:15:30,602 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 189 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:30,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 420 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:15:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-19 01:15:30,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 116. [2024-11-19 01:15:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 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:15:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-11-19 01:15:30,615 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 124 [2024-11-19 01:15:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:30,616 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-11-19 01:15:30,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:15:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-11-19 01:15:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 01:15:30,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:30,619 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] [2024-11-19 01:15:30,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:15:30,620 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:30,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1378439380, now seen corresponding path program 1 times [2024-11-19 01:15:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:30,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317471797] [2024-11-19 01:15:30,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:30,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:31,447 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:15:31,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:31,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317471797] [2024-11-19 01:15:31,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317471797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:31,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:15:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642619219] [2024-11-19 01:15:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:31,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:15:31,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:31,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:15:31,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:15:31,453 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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:15:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:31,933 INFO L93 Difference]: Finished difference Result 285 states and 398 transitions. [2024-11-19 01:15:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:15:31,934 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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 125 [2024-11-19 01:15:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:31,935 INFO L225 Difference]: With dead ends: 285 [2024-11-19 01:15:31,935 INFO L226 Difference]: Without dead ends: 172 [2024-11-19 01:15:31,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:15:31,936 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 226 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:31,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 394 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:15:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-19 01:15:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 129. [2024-11-19 01:15:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 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:15:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2024-11-19 01:15:31,945 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 125 [2024-11-19 01:15:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:31,945 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2024-11-19 01:15:31,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 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:15:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2024-11-19 01:15:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 01:15:31,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:31,947 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] [2024-11-19 01:15:31,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:15:31,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:31,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1244425874, now seen corresponding path program 1 times [2024-11-19 01:15:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:31,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701503831] [2024-11-19 01:15:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:32,309 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:15:32,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:32,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701503831] [2024-11-19 01:15:32,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701503831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:32,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:32,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:15:32,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989131384] [2024-11-19 01:15:32,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:32,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:15:32,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:32,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:15:32,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:15:32,311 INFO L87 Difference]: Start difference. First operand 129 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:15:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:32,442 INFO L93 Difference]: Finished difference Result 257 states and 361 transitions. [2024-11-19 01:15:32,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:15:32,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 125 [2024-11-19 01:15:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:32,444 INFO L225 Difference]: With dead ends: 257 [2024-11-19 01:15:32,444 INFO L226 Difference]: Without dead ends: 131 [2024-11-19 01:15:32,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:15:32,445 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 27 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:32,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 345 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:15:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-19 01:15:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-19 01:15:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 112 states have internal predecessors, (150), 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:15:32,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions. [2024-11-19 01:15:32,452 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 125 [2024-11-19 01:15:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:32,453 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 180 transitions. [2024-11-19 01:15:32,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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:15:32,453 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions. [2024-11-19 01:15:32,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 01:15:32,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:32,454 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] [2024-11-19 01:15:32,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 01:15:32,455 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:32,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:32,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2064726594, now seen corresponding path program 1 times [2024-11-19 01:15:32,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:32,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301298591] [2024-11-19 01:15:32,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:32,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:33,063 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:15:33,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:33,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301298591] [2024-11-19 01:15:33,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301298591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:33,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:33,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:15:33,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421921269] [2024-11-19 01:15:33,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:33,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:15:33,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:33,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:15:33,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:15:33,065 INFO L87 Difference]: Start difference. First operand 129 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:15:33,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:33,438 INFO L93 Difference]: Finished difference Result 300 states and 418 transitions. [2024-11-19 01:15:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:15:33,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 126 [2024-11-19 01:15:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:33,440 INFO L225 Difference]: With dead ends: 300 [2024-11-19 01:15:33,440 INFO L226 Difference]: Without dead ends: 174 [2024-11-19 01:15:33,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:15:33,441 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 237 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:33,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 274 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:15:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-19 01:15:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2024-11-19 01:15:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 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:15:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2024-11-19 01:15:33,451 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 126 [2024-11-19 01:15:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:33,452 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2024-11-19 01:15:33,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:15:33,452 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2024-11-19 01:15:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 01:15:33,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:33,453 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] [2024-11-19 01:15:33,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:15:33,454 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:33,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash 236095996, now seen corresponding path program 1 times [2024-11-19 01:15:33,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:33,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471394883] [2024-11-19 01:15:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:33,834 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:15:33,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:33,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471394883] [2024-11-19 01:15:33,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471394883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:33,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:33,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:15:33,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381221063] [2024-11-19 01:15:33,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:33,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:15:33,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:33,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:15:33,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:15:33,837 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:15:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:34,001 INFO L93 Difference]: Finished difference Result 299 states and 412 transitions. [2024-11-19 01:15:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:15:34,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 126 [2024-11-19 01:15:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:34,003 INFO L225 Difference]: With dead ends: 299 [2024-11-19 01:15:34,003 INFO L226 Difference]: Without dead ends: 171 [2024-11-19 01:15:34,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:15:34,004 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:34,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 390 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:15:34,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-19 01:15:34,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2024-11-19 01:15:34,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 115 states have internal predecessors, (152), 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:15:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2024-11-19 01:15:34,013 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 126 [2024-11-19 01:15:34,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:34,014 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2024-11-19 01:15:34,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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:15:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2024-11-19 01:15:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 01:15:34,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:34,015 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] [2024-11-19 01:15:34,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:15:34,016 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:34,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:34,016 INFO L85 PathProgramCache]: Analyzing trace with hash -519849880, now seen corresponding path program 1 times [2024-11-19 01:15:34,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:34,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672367250] [2024-11-19 01:15:34,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:34,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:34,637 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:15:34,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672367250] [2024-11-19 01:15:34,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672367250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:34,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:34,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:15:34,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569223277] [2024-11-19 01:15:34,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:34,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:15:34,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:34,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:15:34,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:15:34,640 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:15:34,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:34,982 INFO L93 Difference]: Finished difference Result 310 states and 427 transitions. [2024-11-19 01:15:34,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:15:34,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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 126 [2024-11-19 01:15:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:34,984 INFO L225 Difference]: With dead ends: 310 [2024-11-19 01:15:34,984 INFO L226 Difference]: Without dead ends: 181 [2024-11-19 01:15:34,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:15:34,985 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 235 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:34,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 425 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:15:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-19 01:15:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 136. [2024-11-19 01:15:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 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:15:34,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2024-11-19 01:15:34,996 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 126 [2024-11-19 01:15:34,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:34,997 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2024-11-19 01:15:34,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 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:15:34,997 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2024-11-19 01:15:34,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 01:15:35,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:35,001 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] [2024-11-19 01:15:35,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 01:15:35,001 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:35,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:35,001 INFO L85 PathProgramCache]: Analyzing trace with hash 199899249, now seen corresponding path program 1 times [2024-11-19 01:15:35,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:35,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692515411] [2024-11-19 01:15:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:35,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:38,040 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:15:38,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:38,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692515411] [2024-11-19 01:15:38,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692515411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:38,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:38,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:15:38,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199703973] [2024-11-19 01:15:38,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:38,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:15:38,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:38,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:15:38,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:15:38,044 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:15:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:39,090 INFO L93 Difference]: Finished difference Result 321 states and 442 transitions. [2024-11-19 01:15:39,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:15:39,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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 127 [2024-11-19 01:15:39,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:39,092 INFO L225 Difference]: With dead ends: 321 [2024-11-19 01:15:39,092 INFO L226 Difference]: Without dead ends: 188 [2024-11-19 01:15:39,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:15:39,093 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 343 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:39,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 413 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:15:39,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-19 01:15:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 145. [2024-11-19 01:15:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.328125) internal successors, (170), 128 states have internal predecessors, (170), 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:15:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2024-11-19 01:15:39,109 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 127 [2024-11-19 01:15:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:39,109 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2024-11-19 01:15:39,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 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:15:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2024-11-19 01:15:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 01:15:39,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:39,111 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] [2024-11-19 01:15:39,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 01:15:39,112 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:39,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:39,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1744775963, now seen corresponding path program 1 times [2024-11-19 01:15:39,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:39,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762120337] [2024-11-19 01:15:39,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:39,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:39,907 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:15:39,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:39,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762120337] [2024-11-19 01:15:39,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762120337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:39,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:39,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:15:39,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683417673] [2024-11-19 01:15:39,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:39,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:15:39,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:39,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:15:39,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:15:39,909 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:15:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:40,489 INFO L93 Difference]: Finished difference Result 334 states and 459 transitions. [2024-11-19 01:15:40,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:15:40,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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 127 [2024-11-19 01:15:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:40,491 INFO L225 Difference]: With dead ends: 334 [2024-11-19 01:15:40,491 INFO L226 Difference]: Without dead ends: 192 [2024-11-19 01:15:40,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:15:40,491 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 159 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:40,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 438 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:15:40,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-19 01:15:40,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 147. [2024-11-19 01:15:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 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:15:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. [2024-11-19 01:15:40,504 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 203 transitions. Word has length 127 [2024-11-19 01:15:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:40,505 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 203 transitions. [2024-11-19 01:15:40,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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:15:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 203 transitions. [2024-11-19 01:15:40,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 01:15:40,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:40,506 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] [2024-11-19 01:15:40,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 01:15:40,507 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:40,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:40,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1335042000, now seen corresponding path program 1 times [2024-11-19 01:15:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:40,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589769188] [2024-11-19 01:15:40,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:40,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:40,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:40,712 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:15:40,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589769188] [2024-11-19 01:15:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589769188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:15:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705627644] [2024-11-19 01:15:40,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:40,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:15:40,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:15:40,715 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:15:40,716 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:15:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:41,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:15:41,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:15:41,078 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:15:41,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:15:41,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705627644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:41,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:15:41,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 01:15:41,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433409042] [2024-11-19 01:15:41,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:41,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:15:41,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:41,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:15:41,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:15:41,080 INFO L87 Difference]: Start difference. First operand 147 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:15:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:41,116 INFO L93 Difference]: Finished difference Result 294 states and 407 transitions. [2024-11-19 01:15:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:15:41,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 128 [2024-11-19 01:15:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:41,118 INFO L225 Difference]: With dead ends: 294 [2024-11-19 01:15:41,118 INFO L226 Difference]: Without dead ends: 150 [2024-11-19 01:15:41,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:15:41,119 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:41,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:15:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-19 01:15:41,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-19 01:15:41,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 133 states have internal predecessors, (176), 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:15:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 206 transitions. [2024-11-19 01:15:41,131 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 206 transitions. Word has length 128 [2024-11-19 01:15:41,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:41,132 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 206 transitions. [2024-11-19 01:15:41,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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:15:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 206 transitions. [2024-11-19 01:15:41,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 01:15:41,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:41,133 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] [2024-11-19 01:15:41,151 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:15:41,333 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,SelfDestructingSolverStorable15 [2024-11-19 01:15:41,334 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:41,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:41,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1305021189, now seen corresponding path program 1 times [2024-11-19 01:15:41,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:41,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067494510] [2024-11-19 01:15:41,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:41,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:42,010 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:15:42,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:42,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067494510] [2024-11-19 01:15:42,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067494510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:42,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:42,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:15:42,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907104891] [2024-11-19 01:15:42,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:42,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:15:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:42,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:15:42,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:15:42,013 INFO L87 Difference]: Start difference. First operand 150 states and 206 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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:15:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:42,324 INFO L93 Difference]: Finished difference Result 341 states and 465 transitions. [2024-11-19 01:15:42,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:15:42,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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 128 [2024-11-19 01:15:42,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:42,326 INFO L225 Difference]: With dead ends: 341 [2024-11-19 01:15:42,326 INFO L226 Difference]: Without dead ends: 194 [2024-11-19 01:15:42,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:15:42,327 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 261 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:42,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 331 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:15:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-19 01:15:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2024-11-19 01:15:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 129 states have (on average 1.317829457364341) internal successors, (170), 129 states have internal predecessors, (170), 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:15:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2024-11-19 01:15:42,342 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 128 [2024-11-19 01:15:42,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:42,343 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2024-11-19 01:15:42,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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:15:42,343 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2024-11-19 01:15:42,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:15:42,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:42,346 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:15:42,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 01:15:42,347 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:42,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:42,347 INFO L85 PathProgramCache]: Analyzing trace with hash 62037240, now seen corresponding path program 1 times [2024-11-19 01:15:42,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:42,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389424368] [2024-11-19 01:15:42,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:42,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:45,823 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:15:45,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:45,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389424368] [2024-11-19 01:15:45,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389424368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:15:45,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:15:45,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 01:15:45,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350783626] [2024-11-19 01:15:45,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:15:45,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 01:15:45,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:45,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 01:15:45,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:15:45,826 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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:15:46,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:46,995 INFO L93 Difference]: Finished difference Result 342 states and 465 transitions. [2024-11-19 01:15:46,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:15:46,997 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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 129 [2024-11-19 01:15:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:46,998 INFO L225 Difference]: With dead ends: 342 [2024-11-19 01:15:46,999 INFO L226 Difference]: Without dead ends: 199 [2024-11-19 01:15:46,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-19 01:15:47,000 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 165 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:47,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 509 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:15:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-19 01:15:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 148. [2024-11-19 01:15:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 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:15:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2024-11-19 01:15:47,017 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 129 [2024-11-19 01:15:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:47,018 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2024-11-19 01:15:47,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 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:15:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2024-11-19 01:15:47,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:15:47,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:47,019 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:15:47,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 01:15:47,020 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:47,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:47,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1530403510, now seen corresponding path program 1 times [2024-11-19 01:15:47,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:47,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59350270] [2024-11-19 01:15:47,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:47,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:47,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-19 01:15:48,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:15:48,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59350270] [2024-11-19 01:15:48,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59350270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:15:48,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601180565] [2024-11-19 01:15:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:48,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:15:48,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:15:48,160 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:15:48,161 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:15:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:15:48,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-19 01:15:48,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:15:50,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 01:15:51,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 01:15:51,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 01:15:51,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:15:51,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-11-19 01:15:51,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:15:51,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:15:51,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:15:51,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:15:51,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:15:51,999 INFO L349 Elim1Store]: treesize reduction 90, result has 23.1 percent of original size [2024-11-19 01:15:51,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 49 [2024-11-19 01:15:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 153 proven. 65 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-19 01:15:52,016 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:15:52,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601180565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:15:52,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:15:52,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-19 01:15:52,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563077680] [2024-11-19 01:15:52,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:15:52,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-19 01:15:52,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:15:52,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-19 01:15:52,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:15:52,173 INFO L87 Difference]: Start difference. First operand 148 states and 203 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-19 01:15:53,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:15:53,423 INFO L93 Difference]: Finished difference Result 333 states and 457 transitions. [2024-11-19 01:15:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 01:15:53,424 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) Word has length 129 [2024-11-19 01:15:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:15:53,426 INFO L225 Difference]: With dead ends: 333 [2024-11-19 01:15:53,426 INFO L226 Difference]: Without dead ends: 188 [2024-11-19 01:15:53,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2024-11-19 01:15:53,427 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 402 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:15:53,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 384 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 01:15:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-19 01:15:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2024-11-19 01:15:53,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 147 states have (on average 1.2857142857142858) internal successors, (189), 148 states have internal predecessors, (189), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-19 01:15:53,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2024-11-19 01:15:53,451 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 239 transitions. Word has length 129 [2024-11-19 01:15:53,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:15:53,452 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 239 transitions. [2024-11-19 01:15:53,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-19 01:15:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 239 transitions. [2024-11-19 01:15:53,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:15:53,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:15:53,453 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:15:53,472 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:15:53,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:15:53,654 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:15:53,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:15:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1507771256, now seen corresponding path program 1 times [2024-11-19 01:15:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:15:53,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471130030] [2024-11-19 01:15:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:15:53,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:15:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:15:53,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:15:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:15:53,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:15:53,946 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:15:53,947 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:15:53,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 01:15:53,953 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:15:54,107 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:15:54,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:15:54 BoogieIcfgContainer [2024-11-19 01:15:54,113 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:15:54,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:15:54,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:15:54,114 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:15:54,115 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:15:26" (3/4) ... [2024-11-19 01:15:54,117 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:15:54,119 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:15:54,120 INFO L158 Benchmark]: Toolchain (without parser) took 28841.83ms. Allocated memory was 176.2MB in the beginning and 677.4MB in the end (delta: 501.2MB). Free memory was 120.6MB in the beginning and 332.5MB in the end (delta: -212.0MB). Peak memory consumption was 290.1MB. Max. memory is 16.1GB. [2024-11-19 01:15:54,120 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:15:54,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 417.49ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 102.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 01:15:54,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.70ms. Allocated memory is still 176.2MB. Free memory was 102.1MB in the beginning and 98.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:15:54,123 INFO L158 Benchmark]: Boogie Preprocessor took 69.04ms. Allocated memory is still 176.2MB. Free memory was 98.4MB in the beginning and 95.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:15:54,123 INFO L158 Benchmark]: RCFGBuilder took 847.81ms. Allocated memory is still 176.2MB. Free memory was 95.0MB in the beginning and 60.7MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-19 01:15:54,124 INFO L158 Benchmark]: TraceAbstraction took 27411.86ms. Allocated memory was 176.2MB in the beginning and 677.4MB in the end (delta: 501.2MB). Free memory was 59.8MB in the beginning and 332.5MB in the end (delta: -272.7MB). Peak memory consumption was 229.3MB. Max. memory is 16.1GB. [2024-11-19 01:15:54,124 INFO L158 Benchmark]: Witness Printer took 5.50ms. Allocated memory is still 677.4MB. Free memory is still 332.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:15:54,125 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.20ms. Allocated memory is still 176.2MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 417.49ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 102.1MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.70ms. Allocated memory is still 176.2MB. Free memory was 102.1MB in the beginning and 98.4MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.04ms. Allocated memory is still 176.2MB. Free memory was 98.4MB in the beginning and 95.0MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 847.81ms. Allocated memory is still 176.2MB. Free memory was 95.0MB in the beginning and 60.7MB in the end (delta: 34.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 27411.86ms. Allocated memory was 176.2MB in the beginning and 677.4MB in the end (delta: 501.2MB). Free memory was 59.8MB in the beginning and 332.5MB in the end (delta: -272.7MB). Peak memory consumption was 229.3MB. Max. memory is 16.1GB. * Witness Printer took 5.50ms. Allocated memory is still 677.4MB. Free memory is still 332.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryArithmeticDOUBLEoperation at line 89. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 0, 16, 4, 0, 0, 55182, 0, 1, 1, 100, 2.25, 199.4, -128 }; [L55] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] signed char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] signed char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L59] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L60] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L61] unsigned short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [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] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L67] float* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L68] signed char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=0] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L94] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L100] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L103] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L106] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L107] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L112] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L115] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L116] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L129] RET updateVariables() [L130] CALL step() [L72] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L72] COND FALSE !(! (*(WrapperStruct00_var_1_2_Pointer))) [L75] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L75] (*(WrapperStruct00_var_1_12_Pointer)) = ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))) [L77] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L77] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_5_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L78] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L79] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L79] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L80] (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L80] (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L80] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L81] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L81] COND FALSE !((*(WrapperStruct00_var_1_12_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L84] EXPR (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] (*(WrapperStruct00_var_1_1_Pointer)) = (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))))) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] EXPR ((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L89] EXPR ((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] COND FALSE !(((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L121] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121-L122] return (((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.2s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2309 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2297 mSDsluCounter, 7124 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4736 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3909 IncrementalHoareTripleChecker+Invalid, 4083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 2388 mSDtfsCounter, 3909 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 578 GetRequests, 452 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=19, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 418 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 2898 NumberOfCodeBlocks, 2898 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2747 ConstructedInterpolants, 0 QuantifiedInterpolants, 17480 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1580 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 9093/9240 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:15:54,164 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-24.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 eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:15:56,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:15:56,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:15:56,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:15:56,565 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:15:56,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:15:56,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:15:56,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:15:56,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:15:56,602 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:15:56,603 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:15:56,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:15:56,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:15:56,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:15:56,606 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:15:56,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:15:56,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:15:56,607 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:15:56,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:15:56,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:15:56,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:15:56,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:15:56,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:15:56,612 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:15:56,612 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:15:56,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:15:56,613 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:15:56,613 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:15:56,613 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:15:56,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:15:56,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:15:56,614 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:15:56,614 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:15:56,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:15:56,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:15:56,615 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:15:56,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:15:56,618 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:15:56,618 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:15:56,618 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:15:56,619 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:15:56,619 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:15:56,619 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:15:56,619 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:15:56,620 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 -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2024-11-19 01:15:56,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:15:57,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:15:57,022 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:15:57,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:15:57,023 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:15:57,025 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-24.i [2024-11-19 01:15:58,637 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:15:58,849 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:15:58,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-19 01:15:58,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc93e4b4/019dd84a6b4044b297870261c2eb4ee2/FLAGea1951f91 [2024-11-19 01:15:58,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc93e4b4/019dd84a6b4044b297870261c2eb4ee2 [2024-11-19 01:15:58,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:15:58,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:15:58,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:15:58,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:15:58,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:15:58,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:15:58" (1/1) ... [2024-11-19 01:15:58,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8f1eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:58, skipping insertion in model container [2024-11-19 01:15:58,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:15:58" (1/1) ... [2024-11-19 01:15:58,930 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:15:59,124 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-24.i[917,930] [2024-11-19 01:15:59,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:15:59,243 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:15:59,255 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-24.i[917,930] [2024-11-19 01:15:59,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:15:59,309 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:15:59,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59 WrapperNode [2024-11-19 01:15:59,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:15:59,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:15:59,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:15:59,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:15:59,318 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:15:59" (1/1) ... [2024-11-19 01:15:59,343 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:15:59" (1/1) ... [2024-11-19 01:15:59,393 INFO L138 Inliner]: procedures = 34, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 467 [2024-11-19 01:15:59,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:15:59,394 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:15:59,394 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:15:59,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:15:59,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59" (1/1) ... [2024-11-19 01:15:59,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59" (1/1) ... [2024-11-19 01:15:59,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59" (1/1) ... [2024-11-19 01:15:59,467 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-19 01:15:59,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59" (1/1) ... [2024-11-19 01:15:59,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59" (1/1) ... [2024-11-19 01:15:59,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59" (1/1) ... [2024-11-19 01:15:59,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59" (1/1) ... [2024-11-19 01:15:59,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59" (1/1) ... [2024-11-19 01:15:59,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59" (1/1) ... [2024-11-19 01:15:59,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:15:59,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:15:59,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:15:59,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:15:59,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59" (1/1) ... [2024-11-19 01:15:59,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:15:59,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:15:59,560 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:15:59,562 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:15:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:15:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:15:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:15:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:15:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:15:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:15:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:15:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:15:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:15:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:15:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:15:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:15:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:15:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:15:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:15:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:15:59,609 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:15:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-19 01:15:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-19 01:15:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:15:59,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:15:59,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:15:59,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:15:59,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:15:59,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:15:59,762 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:15:59,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:16:18,708 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-19 01:16:18,709 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:16:18,732 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:16:18,734 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:16:18,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:16:18 BoogieIcfgContainer [2024-11-19 01:16:18,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:16:18,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:16:18,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:16:18,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:16:18,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:15:58" (1/3) ... [2024-11-19 01:16:18,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62005292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:16:18, skipping insertion in model container [2024-11-19 01:16:18,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:15:59" (2/3) ... [2024-11-19 01:16:18,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62005292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:16:18, skipping insertion in model container [2024-11-19 01:16:18,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:16:18" (3/3) ... [2024-11-19 01:16:18,744 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-19 01:16:18,762 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:16:18,762 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:16:18,825 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:16:18,834 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;@38b2a9d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:16:18,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:16:18,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 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:16:18,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:16:18,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:16:18,854 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] [2024-11-19 01:16:18,855 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:16:18,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:16:18,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1133390607, now seen corresponding path program 1 times [2024-11-19 01:16:18,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:16:18,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406922442] [2024-11-19 01:16:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:16:18,879 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:16:18,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:16:18,882 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:16:18,884 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:16:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:16:20,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:16:20,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:16:20,101 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-19 01:16:20,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:16:20,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:16:20,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406922442] [2024-11-19 01:16:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406922442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:16:20,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:16:20,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:16:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638146239] [2024-11-19 01:16:20,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:16:20,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:16:20,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:16:20,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:16:20,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:16:20,147 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 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 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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:16:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:16:20,187 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-19 01:16:20,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:16:20,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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 124 [2024-11-19 01:16:20,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:16:20,199 INFO L225 Difference]: With dead ends: 195 [2024-11-19 01:16:20,200 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 01:16:20,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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:16:20,212 INFO L432 NwaCegarLoop]: 139 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, 139 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:16:20,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:16:20,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 01:16:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 01:16:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 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:16:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-19 01:16:20,260 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-19 01:16:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:16:20,261 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-19 01:16:20,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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:16:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-19 01:16:20,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:16:20,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:16:20,264 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] [2024-11-19 01:16:20,298 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:16:20,465 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:16:20,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:16:20,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:16:20,466 INFO L85 PathProgramCache]: Analyzing trace with hash -191984407, now seen corresponding path program 1 times [2024-11-19 01:16:20,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:16:20,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388460790] [2024-11-19 01:16:20,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:16:20,467 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:16:20,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:16:20,470 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:16:20,472 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:16:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:16:21,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 01:16:21,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:16:21,737 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:16:21,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:16:21,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:16:21,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388460790] [2024-11-19 01:16:21,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388460790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:16:21,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:16:21,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:16:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887301369] [2024-11-19 01:16:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:16:21,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:16:21,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:16:21,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:16:21,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:16:21,744 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:16:21,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:16:21,952 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-19 01:16:21,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:16:21,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 124 [2024-11-19 01:16:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:16:21,955 INFO L225 Difference]: With dead ends: 192 [2024-11-19 01:16:21,955 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 01:16:21,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:16:21,957 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:16:21,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:16:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 01:16:21,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-19 01:16:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 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:16:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-19 01:16:21,970 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2024-11-19 01:16:21,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:16:21,975 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-19 01:16:21,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:16:21,975 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-19 01:16:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:16:21,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:16:21,978 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] [2024-11-19 01:16:22,007 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:16:22,178 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:16:22,179 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:16:22,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:16:22,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1997422741, now seen corresponding path program 1 times [2024-11-19 01:16:22,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:16:22,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318215355] [2024-11-19 01:16:22,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:16:22,181 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:16:22,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:16:22,185 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:16:22,186 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:16:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:16:23,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 01:16:23,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:16:23,467 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:16:23,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:16:23,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:16:23,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318215355] [2024-11-19 01:16:23,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318215355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:16:23,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:16:23,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:16:23,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975642168] [2024-11-19 01:16:23,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:16:23,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:16:23,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:16:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:16:23,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:16:23,472 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:16:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:16:23,655 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-19 01:16:23,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:16:23,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 124 [2024-11-19 01:16:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:16:23,657 INFO L225 Difference]: With dead ends: 194 [2024-11-19 01:16:23,657 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 01:16:23,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:16:23,660 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:16:23,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:16:23,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 01:16:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-19 01:16:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 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:16:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-19 01:16:23,676 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-19 01:16:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:16:23,678 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-19 01:16:23,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:16:23,679 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-19 01:16:23,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:16:23,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:16:23,681 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] [2024-11-19 01:16:23,709 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 (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:16:23,882 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:16:23,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:16:23,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:16:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1276476201, now seen corresponding path program 1 times [2024-11-19 01:16:23,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:16:23,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268029326] [2024-11-19 01:16:23,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:16:23,884 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:16:23,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:16:23,888 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:16:23,890 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:16:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:16:25,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:16:25,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:16:25,703 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:16:25,703 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:16:25,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:16:25,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [268029326] [2024-11-19 01:16:25,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [268029326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:16:25,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:16:25,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:16:25,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816826614] [2024-11-19 01:16:25,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:16:25,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:16:25,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:16:25,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:16:25,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:16:25,707 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:16:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:16:26,563 INFO L93 Difference]: Finished difference Result 200 states and 286 transitions. [2024-11-19 01:16:26,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:16:26,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 124 [2024-11-19 01:16:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:16:26,565 INFO L225 Difference]: With dead ends: 200 [2024-11-19 01:16:26,565 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 01:16:26,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:16:26,567 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 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.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:16:26,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:16:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 01:16:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-19 01:16:26,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 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:16:26,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-19 01:16:26,581 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-19 01:16:26,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:16:26,581 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-19 01:16:26,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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:16:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-19 01:16:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:16:26,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:16:26,587 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] [2024-11-19 01:16:26,632 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:16:26,788 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:16:26,789 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:16:26,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:16:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1956534571, now seen corresponding path program 1 times [2024-11-19 01:16:26,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:16:26,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787904988] [2024-11-19 01:16:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:16:26,790 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:16:26,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:16:26,794 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:16:26,795 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:16:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:16:27,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:16:27,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:16:28,803 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:16:28,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:16:28,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:16:28,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787904988] [2024-11-19 01:16:28,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787904988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:16:28,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:16:28,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:16:28,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215998222] [2024-11-19 01:16:28,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:16:28,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:16:28,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:16:28,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:16:28,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:16:28,807 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:16:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:16:29,961 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-19 01:16:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:16:29,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 124 [2024-11-19 01:16:29,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:16:29,969 INFO L225 Difference]: With dead ends: 206 [2024-11-19 01:16:29,969 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:16:29,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:16:29,975 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:16:29,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 01:16:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:16:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-19 01:16:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 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:16:29,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-19 01:16:29,990 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-19 01:16:29,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:16:29,991 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-19 01:16:29,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:16:29,991 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-19 01:16:29,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:16:29,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:16:29,997 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] [2024-11-19 01:16:30,038 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:16:30,197 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:16:30,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:16:30,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:16:30,200 INFO L85 PathProgramCache]: Analyzing trace with hash -563425363, now seen corresponding path program 1 times [2024-11-19 01:16:30,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:16:30,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183057076] [2024-11-19 01:16:30,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:16:30,201 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:16:30,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:16:30,206 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:16:30,215 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:16:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:16:31,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 01:16:31,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:16:32,480 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:16:32,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:16:32,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:16:32,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183057076] [2024-11-19 01:16:32,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183057076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:16:32,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:16:32,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:16:32,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839401047] [2024-11-19 01:16:32,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:16:32,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:16:32,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:16:32,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:16:32,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:16:32,482 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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:16:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:16:33,928 INFO L93 Difference]: Finished difference Result 210 states and 295 transitions. [2024-11-19 01:16:33,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:16:33,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 124 [2024-11-19 01:16:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:16:33,930 INFO L225 Difference]: With dead ends: 210 [2024-11-19 01:16:33,930 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 01:16:33,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:16:33,933 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:16:33,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 761 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 01:16:33,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 01:16:33,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-19 01:16:33,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 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:16:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-11-19 01:16:33,950 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2024-11-19 01:16:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:16:33,955 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-11-19 01:16:33,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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:16:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-11-19 01:16:33,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:16:33,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:16:33,957 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] [2024-11-19 01:16:33,996 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:16:34,161 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:16:34,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:16:34,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:16:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash -561578321, now seen corresponding path program 1 times [2024-11-19 01:16:34,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:16:34,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167318285] [2024-11-19 01:16:34,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:16:34,163 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:16:34,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:16:34,164 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:16:34,166 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:16:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:16:36,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 01:16:36,212 INFO L278 TraceCheckSpWp]: Computing forward predicates...