./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.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 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:17:44,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:17:44,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:17:44,079 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:17:44,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:17:44,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:17:44,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:17:44,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:17:44,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:17:44,105 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:17:44,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:17:44,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:17:44,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:17:44,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:17:44,107 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:17:44,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:17:44,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:17:44,109 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:17:44,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:17:44,109 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:17:44,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:17:44,112 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:17:44,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:17:44,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:17:44,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:17:44,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:17:44,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:17:44,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:17:44,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:17:44,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:17:44,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:17:44,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:17:44,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:17:44,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:17:44,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:17:44,114 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:17:44,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:17:44,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:17:44,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:17:44,115 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:17:44,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:17:44,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:17:44,117 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 -> 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 [2024-11-09 02:17:44,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:17:44,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:17:44,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:17:44,378 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:17:44,378 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:17:44,380 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-82.i [2024-11-09 02:17:45,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:17:45,826 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:17:45,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.i [2024-11-09 02:17:45,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1960aef3d/2ad9e7bdac3e489b88bcc14a519a8740/FLAGa8f287cd3 [2024-11-09 02:17:46,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1960aef3d/2ad9e7bdac3e489b88bcc14a519a8740 [2024-11-09 02:17:46,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:17:46,224 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:17:46,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:17:46,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:17:46,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:17:46,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eaaf073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46, skipping insertion in model container [2024-11-09 02:17:46,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,267 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:17:46,417 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-82.i[917,930] [2024-11-09 02:17:46,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:17:46,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:17:46,498 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-82.i[917,930] [2024-11-09 02:17:46,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:17:46,574 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:17:46,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46 WrapperNode [2024-11-09 02:17:46,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:17:46,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:17:46,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:17:46,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:17:46,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,600 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,639 INFO L138 Inliner]: procedures = 30, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 524 [2024-11-09 02:17:46,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:17:46,641 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:17:46,641 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:17:46,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:17:46,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,674 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:17:46,675 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:17:46,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:17:46,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:17:46,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:17:46,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (1/1) ... [2024-11-09 02:17:46,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:17:46,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:17:46,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:17:46,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:17:46,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:17:46,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:17:46,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:17:46,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:17:46,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:17:46,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:17:46,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:17:46,865 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:17:46,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:17:46,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:17:46,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:17:46,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:17:46,993 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:17:46,995 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:17:47,606 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2024-11-09 02:17:47,607 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:17:47,618 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:17:47,618 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:17:47,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:17:47 BoogieIcfgContainer [2024-11-09 02:17:47,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:17:47,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:17:47,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:17:47,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:17:47,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:17:46" (1/3) ... [2024-11-09 02:17:47,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d36f1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:17:47, skipping insertion in model container [2024-11-09 02:17:47,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:46" (2/3) ... [2024-11-09 02:17:47,625 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d36f1ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:17:47, skipping insertion in model container [2024-11-09 02:17:47,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:17:47" (3/3) ... [2024-11-09 02:17:47,627 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-82.i [2024-11-09 02:17:47,643 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:17:47,643 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:17:47,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:17:47,728 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;@2fdfe664, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:17:47,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:17:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:47,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 02:17:47,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:47,747 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:47,748 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:47,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1098584033, now seen corresponding path program 1 times [2024-11-09 02:17:47,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:47,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650273392] [2024-11-09 02:17:47,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:47,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:48,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:48,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:48,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:48,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:48,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650273392] [2024-11-09 02:17:48,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650273392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:48,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:48,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:17:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509805053] [2024-11-09 02:17:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:48,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:17:48,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:48,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:17:48,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:17:48,366 INFO L87 Difference]: Start difference. First operand has 115 states, 98 states have (on average 1.4285714285714286) internal successors, (140), 99 states have internal predecessors, (140), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:48,397 INFO L93 Difference]: Finished difference Result 223 states and 344 transitions. [2024-11-09 02:17:48,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:17:48,399 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-09 02:17:48,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:48,409 INFO L225 Difference]: With dead ends: 223 [2024-11-09 02:17:48,409 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 02:17:48,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:17:48,415 INFO L432 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:48,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:48,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 02:17:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 02:17:48,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2024-11-09 02:17:48,472 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 121 [2024-11-09 02:17:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:48,475 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2024-11-09 02:17:48,476 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), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2024-11-09 02:17:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 02:17:48,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:48,481 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:48,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:17:48,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:48,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:48,483 INFO L85 PathProgramCache]: Analyzing trace with hash -879729315, now seen corresponding path program 1 times [2024-11-09 02:17:48,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:48,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564528309] [2024-11-09 02:17:48,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:48,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:48,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:48,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:48,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:48,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564528309] [2024-11-09 02:17:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564528309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:48,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:17:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012187609] [2024-11-09 02:17:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:48,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:17:48,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:48,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:17:48,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:48,879 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:48,923 INFO L93 Difference]: Finished difference Result 221 states and 314 transitions. [2024-11-09 02:17:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:17:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-09 02:17:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:48,926 INFO L225 Difference]: With dead ends: 221 [2024-11-09 02:17:48,926 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 02:17:48,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 31 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-09 02:17:48,928 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 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-09 02:17:48,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 02:17:48,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-09 02:17:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2024-11-09 02:17:48,940 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 121 [2024-11-09 02:17:48,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:48,941 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2024-11-09 02:17:48,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2024-11-09 02:17:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:17:48,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:48,945 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:48,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:17:48,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:48,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:48,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1839409295, now seen corresponding path program 1 times [2024-11-09 02:17:48,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:48,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670929967] [2024-11-09 02:17:48,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:48,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:49,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:49,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670929967] [2024-11-09 02:17:49,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670929967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:49,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:49,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:17:49,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781219823] [2024-11-09 02:17:49,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:49,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:17:49,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:49,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:17:49,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:17:49,234 INFO L87 Difference]: Start difference. First operand 113 states and 159 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:49,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:49,282 INFO L93 Difference]: Finished difference Result 226 states and 319 transitions. [2024-11-09 02:17:49,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:17:49,282 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:17:49,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:49,284 INFO L225 Difference]: With dead ends: 226 [2024-11-09 02:17:49,284 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 02:17:49,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:17:49,285 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:49,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:49,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 02:17:49,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-09 02:17:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-09 02:17:49,295 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 123 [2024-11-09 02:17:49,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:49,296 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-09 02:17:49,296 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:49,296 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-09 02:17:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:17:49,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:49,299 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:49,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:17:49,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:49,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:49,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1357109132, now seen corresponding path program 1 times [2024-11-09 02:17:49,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:49,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571940852] [2024-11-09 02:17:49,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:49,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:49,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:49,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:49,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571940852] [2024-11-09 02:17:49,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571940852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:49,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:49,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:17:49,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142687770] [2024-11-09 02:17:49,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:49,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:17:49,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:49,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:17:49,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:49,461 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:49,489 INFO L93 Difference]: Finished difference Result 228 states and 321 transitions. [2024-11-09 02:17:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:17:49,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-09 02:17:49,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:49,491 INFO L225 Difference]: With dead ends: 228 [2024-11-09 02:17:49,491 INFO L226 Difference]: Without dead ends: 117 [2024-11-09 02:17:49,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-09 02:17:49,492 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 451 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-09 02:17:49,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 451 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:49,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-09 02:17:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-09 02:17:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 100 states have (on average 1.34) internal successors, (134), 100 states have internal predecessors, (134), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-11-09 02:17:49,511 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 125 [2024-11-09 02:17:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:49,511 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-11-09 02:17:49,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-11-09 02:17:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:17:49,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:49,515 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:49,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:17:49,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:49,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:49,516 INFO L85 PathProgramCache]: Analyzing trace with hash -677050762, now seen corresponding path program 1 times [2024-11-09 02:17:49,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:49,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534429853] [2024-11-09 02:17:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:49,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:49,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534429853] [2024-11-09 02:17:49,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534429853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:49,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:49,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:17:49,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326528285] [2024-11-09 02:17:49,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:49,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:17:49,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:49,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:17:49,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:49,672 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:49,694 INFO L93 Difference]: Finished difference Result 232 states and 325 transitions. [2024-11-09 02:17:49,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:17:49,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-09 02:17:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:49,695 INFO L225 Difference]: With dead ends: 232 [2024-11-09 02:17:49,695 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 02:17:49,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-09 02:17:49,696 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 452 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-09 02:17:49,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 452 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 02:17:49,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-09 02:17:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 102 states have internal predecessors, (136), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2024-11-09 02:17:49,703 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 125 [2024-11-09 02:17:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:49,703 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2024-11-09 02:17:49,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2024-11-09 02:17:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:17:49,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:49,705 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:49,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:17:49,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:49,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1097956600, now seen corresponding path program 1 times [2024-11-09 02:17:49,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:49,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713789797] [2024-11-09 02:17:49,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:49,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:49,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:49,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:49,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713789797] [2024-11-09 02:17:49,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713789797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:49,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:49,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:17:49,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805386907] [2024-11-09 02:17:49,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:49,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:17:49,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:49,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:17:49,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:49,860 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:49,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:49,881 INFO L93 Difference]: Finished difference Result 236 states and 329 transitions. [2024-11-09 02:17:49,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:17:49,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-09 02:17:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:49,885 INFO L225 Difference]: With dead ends: 236 [2024-11-09 02:17:49,885 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 02:17:49,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-09 02:17:49,887 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 454 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-09 02:17:49,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 454 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:49,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 02:17:49,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2024-11-09 02:17:49,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 104 states have (on average 1.3269230769230769) internal successors, (138), 104 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:17:49,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 166 transitions. [2024-11-09 02:17:49,899 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 166 transitions. Word has length 125 [2024-11-09 02:17:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:49,899 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 166 transitions. [2024-11-09 02:17:49,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 166 transitions. [2024-11-09 02:17:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:17:49,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:49,901 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:49,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:17:49,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:49,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:49,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1099803642, now seen corresponding path program 1 times [2024-11-09 02:17:49,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:49,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954654246] [2024-11-09 02:17:49,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:50,389 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:50,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954654246] [2024-11-09 02:17:50,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954654246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:50,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:50,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:17:50,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719680502] [2024-11-09 02:17:50,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:50,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:17:50,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:50,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:17:50,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:17:50,391 INFO L87 Difference]: Start difference. First operand 120 states and 166 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:50,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:50,667 INFO L93 Difference]: Finished difference Result 353 states and 491 transitions. [2024-11-09 02:17:50,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:17:50,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-09 02:17:50,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:50,669 INFO L225 Difference]: With dead ends: 353 [2024-11-09 02:17:50,669 INFO L226 Difference]: Without dead ends: 236 [2024-11-09 02:17:50,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:17:50,670 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 135 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:50,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 607 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:17:50,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-09 02:17:50,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 198. [2024-11-09 02:17:50,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 167 states have (on average 1.3233532934131738) internal successors, (221), 167 states have internal predecessors, (221), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:17:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 277 transitions. [2024-11-09 02:17:50,681 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 277 transitions. Word has length 125 [2024-11-09 02:17:50,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:50,682 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 277 transitions. [2024-11-09 02:17:50,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 277 transitions. [2024-11-09 02:17:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:17:50,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:50,683 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:50,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:17:50,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:50,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash -71441437, now seen corresponding path program 1 times [2024-11-09 02:17:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:50,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800782552] [2024-11-09 02:17:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800782552] [2024-11-09 02:17:51,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800782552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:51,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:51,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:17:51,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701969614] [2024-11-09 02:17:51,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:51,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:17:51,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:51,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:17:51,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:51,119 INFO L87 Difference]: Start difference. First operand 198 states and 277 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:51,250 INFO L93 Difference]: Finished difference Result 312 states and 436 transitions. [2024-11-09 02:17:51,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:17:51,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2024-11-09 02:17:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:51,252 INFO L225 Difference]: With dead ends: 312 [2024-11-09 02:17:51,252 INFO L226 Difference]: Without dead ends: 188 [2024-11-09 02:17:51,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-09 02:17:51,254 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:51,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 396 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:17:51,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-09 02:17:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-11-09 02:17:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 157 states have (on average 1.305732484076433) internal successors, (205), 157 states have internal predecessors, (205), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:17:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 261 transitions. [2024-11-09 02:17:51,268 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 261 transitions. Word has length 125 [2024-11-09 02:17:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:51,269 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 261 transitions. [2024-11-09 02:17:51,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 261 transitions. [2024-11-09 02:17:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 02:17:51,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:51,270 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:51,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:17:51,270 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:51,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1854103171, now seen corresponding path program 1 times [2024-11-09 02:17:51,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:51,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10555028] [2024-11-09 02:17:51,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:51,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:51,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:51,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10555028] [2024-11-09 02:17:51,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10555028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:51,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:51,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:17:51,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219077165] [2024-11-09 02:17:51,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:51,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:17:51,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:51,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:17:51,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:17:51,471 INFO L87 Difference]: Start difference. First operand 188 states and 261 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:51,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:51,705 INFO L93 Difference]: Finished difference Result 366 states and 505 transitions. [2024-11-09 02:17:51,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:17:51,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 126 [2024-11-09 02:17:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:51,707 INFO L225 Difference]: With dead ends: 366 [2024-11-09 02:17:51,707 INFO L226 Difference]: Without dead ends: 254 [2024-11-09 02:17:51,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:17:51,708 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 70 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:51,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 690 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:17:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-09 02:17:51,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 218. [2024-11-09 02:17:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 187 states have (on average 1.3262032085561497) internal successors, (248), 187 states have internal predecessors, (248), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:17:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 304 transitions. [2024-11-09 02:17:51,719 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 304 transitions. Word has length 126 [2024-11-09 02:17:51,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:51,720 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 304 transitions. [2024-11-09 02:17:51,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:17:51,720 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 304 transitions. [2024-11-09 02:17:51,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 02:17:51,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:51,723 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:51,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:17:51,723 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:51,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:51,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1982266938, now seen corresponding path program 1 times [2024-11-09 02:17:51,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:51,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024337656] [2024-11-09 02:17:51,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:51,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:17:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:17:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:17:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:17:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:17:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:17:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:56,946 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:17:56,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:56,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024337656] [2024-11-09 02:17:56,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024337656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:56,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:56,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 02:17:56,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217031429] [2024-11-09 02:17:56,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:56,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 02:17:56,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:56,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 02:17:56,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:17:56,948 INFO L87 Difference]: Start difference. First operand 218 states and 304 transitions. Second operand has 17 states, 14 states have (on average 4.214285714285714) internal successors, (59), 17 states have internal predecessors, (59), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-09 02:17:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:59,528 INFO L93 Difference]: Finished difference Result 525 states and 725 transitions. [2024-11-09 02:17:59,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 02:17:59,529 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.214285714285714) internal successors, (59), 17 states have internal predecessors, (59), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) Word has length 126 [2024-11-09 02:17:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:59,531 INFO L225 Difference]: With dead ends: 525 [2024-11-09 02:17:59,531 INFO L226 Difference]: Without dead ends: 383 [2024-11-09 02:17:59,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2024-11-09 02:17:59,532 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 355 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:59,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1121 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 02:17:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-09 02:17:59,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 262. [2024-11-09 02:17:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 231 states have (on average 1.3333333333333333) internal successors, (308), 231 states have internal predecessors, (308), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:17:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 364 transitions. [2024-11-09 02:17:59,557 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 364 transitions. Word has length 126 [2024-11-09 02:17:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:59,558 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 364 transitions. [2024-11-09 02:17:59,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.214285714285714) internal successors, (59), 17 states have internal predecessors, (59), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-09 02:17:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 364 transitions. [2024-11-09 02:17:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 02:17:59,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:59,559 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:59,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:17:59,559 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:59,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash 21578577, now seen corresponding path program 1 times [2024-11-09 02:17:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:59,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762877607] [2024-11-09 02:17:59,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:17:59,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:17:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:18:00,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:18:00,082 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:18:00,083 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:18:00,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:18:00,096 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:00,217 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:18:00,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:18:00 BoogieIcfgContainer [2024-11-09 02:18:00,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:18:00,220 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:18:00,220 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:18:00,220 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:18:00,220 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:17:47" (3/4) ... [2024-11-09 02:18:00,223 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:18:00,224 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:18:00,224 INFO L158 Benchmark]: Toolchain (without parser) took 14000.00ms. Allocated memory was 163.6MB in the beginning and 585.1MB in the end (delta: 421.5MB). Free memory was 89.7MB in the beginning and 454.8MB in the end (delta: -365.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-09 02:18:00,224 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:18:00,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.82ms. Allocated memory is still 163.6MB. Free memory was 89.5MB in the beginning and 71.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 02:18:00,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.71ms. Allocated memory is still 163.6MB. Free memory was 71.6MB in the beginning and 66.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:18:00,225 INFO L158 Benchmark]: Boogie Preprocessor took 79.84ms. Allocated memory is still 163.6MB. Free memory was 66.6MB in the beginning and 62.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:18:00,225 INFO L158 Benchmark]: RCFGBuilder took 898.01ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 62.8MB in the beginning and 175.3MB in the end (delta: -112.5MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. [2024-11-09 02:18:00,225 INFO L158 Benchmark]: TraceAbstraction took 12598.86ms. Allocated memory was 243.3MB in the beginning and 585.1MB in the end (delta: 341.8MB). Free memory was 175.3MB in the beginning and 454.8MB in the end (delta: -279.5MB). Peak memory consumption was 319.2MB. Max. memory is 16.1GB. [2024-11-09 02:18:00,225 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 585.1MB. Free memory is still 454.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:18:00,226 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.23ms. Allocated memory is still 163.6MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.82ms. Allocated memory is still 163.6MB. Free memory was 89.5MB in the beginning and 71.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.71ms. Allocated memory is still 163.6MB. Free memory was 71.6MB in the beginning and 66.6MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.84ms. Allocated memory is still 163.6MB. Free memory was 66.6MB in the beginning and 62.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 898.01ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 62.8MB in the beginning and 175.3MB in the end (delta: -112.5MB). Peak memory consumption was 18.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12598.86ms. Allocated memory was 243.3MB in the beginning and 585.1MB in the end (delta: 341.8MB). Free memory was 175.3MB in the beginning and 454.8MB in the end (delta: -279.5MB). Peak memory consumption was 319.2MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 585.1MB. Free memory is still 454.8MB. 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 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 132. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L55] float* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L58] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L59] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L60] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L61] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L63] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L65] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L66] double* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L67] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L68] double* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L69] unsigned char last_1_WrapperStruct00_var_1_5 = 32; [L70] unsigned char last_1_WrapperStruct00_var_1_12 = 2; [L71] unsigned char last_1_WrapperStruct00_var_1_17 = 0; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=0, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] CALL updateLastVariables() [L127] EXPR WrapperStruct00.var_1_5 [L127] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L128] EXPR WrapperStruct00.var_1_12 [L128] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L129] EXPR WrapperStruct00.var_1_17 [L129] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L139] RET updateLastVariables() [L140] CALL updateVariables() [L103] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L106] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_3 [L107] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_3 [L107] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L108] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L109] EXPR WrapperStruct00.var_1_4 [L109] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_4 [L109] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L112] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L113] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L115] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L116] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L119] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L121] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L122] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L124] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L140] RET updateVariables() [L141] CALL step() [L75] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L75] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12; [L76] COND FALSE !((last_1_WrapperStruct00_var_1_5 / -2) >= stepLocal_0) [L79] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L79] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L79] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L79] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L79] (*(WrapperStruct00_var_1_5_Pointer)) = ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))) [L81] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L81] COND FALSE !(! (*(WrapperStruct00_var_1_2_Pointer))) [L86] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L86] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L87] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L87] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_9_Pointer)) [L88] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L88] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_3_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L89] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_9_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32, stepLocal_1=-121] [L90] COND FALSE !(((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= stepLocal_1) [L99] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L99] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_9_Pointer)) [L141] RET step() [L142] CALL, EXPR property() [L132] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) [L132] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) [L132] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L132] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) [L132] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L132] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L132] EXPR ((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR (((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L132] EXPR (((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132] EXPR ((((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((double) (*(WrapperStruct00_var_1_3_Pointer)))) [L132] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L132] EXPR ((((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((double) (*(WrapperStruct00_var_1_3_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L132-L133] return ((((((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_3_Pointer))) > ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_5_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) - (((((*(WrapperStruct00_var_1_11_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) + (*(WrapperStruct00_var_1_11_Pointer))) >= (*(WrapperStruct00_var_1_9_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((*(WrapperStruct00_var_1_1_Pointer)) * (*(WrapperStruct00_var_1_3_Pointer)))))) <= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_15_Pointer))))) : 1)) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((double) (*(WrapperStruct00_var_1_4_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((double) (*(WrapperStruct00_var_1_3_Pointer)))) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_14_Pointer={4:18}, WrapperStruct00_var_1_15_Pointer={4:19}, WrapperStruct00_var_1_16_Pointer={4:20}, WrapperStruct00_var_1_17_Pointer={4:28}, WrapperStruct00_var_1_18_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_5_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 11, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 563 mSDsluCounter, 5383 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3938 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1560 IncrementalHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 1445 mSDtfsCounter, 1560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=10, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 200 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1370 NumberOfCodeBlocks, 1370 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1232 ConstructedInterpolants, 0 QuantifiedInterpolants, 5971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3640/3640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 02:18:00,263 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-82.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 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:18:02,402 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:18:02,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:18:02,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:18:02,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:18:02,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:18:02,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:18:02,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:18:02,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:18:02,497 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:18:02,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:18:02,498 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:18:02,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:18:02,499 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:18:02,501 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:18:02,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:18:02,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:18:02,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:18:02,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:18:02,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:18:02,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:18:02,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:18:02,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:18:02,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:18:02,503 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:18:02,503 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:18:02,503 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:18:02,503 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:18:02,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:18:02,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:18:02,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:18:02,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:18:02,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:18:02,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:18:02,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:18:02,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:18:02,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:18:02,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:18:02,505 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:18:02,505 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:18:02,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:18:02,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:18:02,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:18:02,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:18:02,506 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 -> 895e31068043c8e643e0118b1d4631b5103422d80ccaa5bb3d4d092e33709158 [2024-11-09 02:18:02,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:18:02,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:18:02,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:18:02,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:18:02,857 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:18:02,859 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-82.i [2024-11-09 02:18:04,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:18:04,523 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:18:04,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-82.i [2024-11-09 02:18:04,543 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b38eca3/ccbbb5c5ce224f5aa151c3e3a4736dd6/FLAG1d307615e [2024-11-09 02:18:04,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b38eca3/ccbbb5c5ce224f5aa151c3e3a4736dd6 [2024-11-09 02:18:04,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:18:04,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:18:04,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:18:04,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:18:04,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:18:04,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f6f3b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04, skipping insertion in model container [2024-11-09 02:18:04,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:18:04,765 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-82.i[917,930] [2024-11-09 02:18:04,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:18:04,852 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:18:04,865 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-82.i[917,930] [2024-11-09 02:18:04,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:18:04,941 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:18:04,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04 WrapperNode [2024-11-09 02:18:04,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:18:04,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:18:04,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:18:04,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:18:04,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:04,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:05,021 INFO L138 Inliner]: procedures = 34, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2024-11-09 02:18:05,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:18:05,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:18:05,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:18:05,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:18:05,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:05,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:05,047 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:05,074 INFO L175 MemorySlicer]: Split 134 memory accesses to 2 slices as follows [2, 132]. 99 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-09 02:18:05,075 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:05,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:05,086 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:05,090 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:05,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:05,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:05,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:18:05,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:18:05,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:18:05,101 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:18:05,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (1/1) ... [2024-11-09 02:18:05,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:18:05,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:18:05,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:18:05,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:18:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:18:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 02:18:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 02:18:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-09 02:18:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-09 02:18:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:18:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:18:05,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:18:05,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 02:18:05,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 02:18:05,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:18:05,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:18:05,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:18:05,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:18:05,341 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:18:05,343 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:18:08,704 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-09 02:18:08,704 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:18:08,725 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:18:08,726 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:18:08,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:18:08 BoogieIcfgContainer [2024-11-09 02:18:08,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:18:08,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:18:08,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:18:08,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:18:08,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:18:04" (1/3) ... [2024-11-09 02:18:08,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1808c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:18:08, skipping insertion in model container [2024-11-09 02:18:08,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:04" (2/3) ... [2024-11-09 02:18:08,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1808c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:18:08, skipping insertion in model container [2024-11-09 02:18:08,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:18:08" (3/3) ... [2024-11-09 02:18:08,737 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-82.i [2024-11-09 02:18:08,752 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:18:08,752 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:18:08,823 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:18:08,830 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;@d11a694, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:18:08,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:18:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:18:08,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 02:18:08,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:08,849 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:08,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:08,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:08,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1212278794, now seen corresponding path program 1 times [2024-11-09 02:18:08,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:18:08,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321017374] [2024-11-09 02:18:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:08,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:08,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:18:08,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:18:08,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 02:18:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:09,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:18:09,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:18:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-09 02:18:09,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:18:09,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:18:09,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321017374] [2024-11-09 02:18:09,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321017374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:09,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:09,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:18:09,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436856343] [2024-11-09 02:18:09,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:09,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:18:09,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:18:09,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:18:09,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:18:09,280 INFO L87 Difference]: Start difference. First operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:18:09,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:09,307 INFO L93 Difference]: Finished difference Result 209 states and 322 transitions. [2024-11-09 02:18:09,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:18:09,310 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-09 02:18:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:09,323 INFO L225 Difference]: With dead ends: 209 [2024-11-09 02:18:09,323 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 02:18:09,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:18:09,334 INFO L432 NwaCegarLoop]: 146 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, 146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:09,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:18:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 02:18:09,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 02:18:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:18:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2024-11-09 02:18:09,372 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 119 [2024-11-09 02:18:09,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:09,373 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2024-11-09 02:18:09,374 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:18:09,374 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2024-11-09 02:18:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 02:18:09,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:09,377 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:09,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 02:18:09,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:09,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:09,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash 579592156, now seen corresponding path program 1 times [2024-11-09 02:18:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:18:09,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144173776] [2024-11-09 02:18:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:09,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:09,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:18:09,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:18:09,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 02:18:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:09,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:18:09,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:18:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-09 02:18:09,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:18:09,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:18:09,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144173776] [2024-11-09 02:18:09,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144173776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:09,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:09,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:18:09,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061827627] [2024-11-09 02:18:09,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:09,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:18:09,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:18:09,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:18:09,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:18:09,949 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:18:10,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:10,021 INFO L93 Difference]: Finished difference Result 207 states and 292 transitions. [2024-11-09 02:18:10,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:18:10,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-09 02:18:10,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:10,024 INFO L225 Difference]: With dead ends: 207 [2024-11-09 02:18:10,025 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 02:18:10,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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-09 02:18:10,027 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 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-09 02:18:10,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:18:10,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 02:18:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 02:18:10,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:18:10,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-11-09 02:18:10,044 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 119 [2024-11-09 02:18:10,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:10,046 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-11-09 02:18:10,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:18:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-11-09 02:18:10,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 02:18:10,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:10,051 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:10,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 02:18:10,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:10,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:10,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:10,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1848666466, now seen corresponding path program 1 times [2024-11-09 02:18:10,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:18:10,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355786474] [2024-11-09 02:18:10,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:10,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:10,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:18:10,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:18:10,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 02:18:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:10,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:18:10,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:18:10,569 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:18:10,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:18:10,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:18:10,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355786474] [2024-11-09 02:18:10,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355786474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:10,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:10,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:18:10,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830796974] [2024-11-09 02:18:10,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:10,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:18:10,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:18:10,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:18:10,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:18:10,573 INFO L87 Difference]: Start difference. First operand 106 states and 148 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:10,615 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2024-11-09 02:18:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:18:10,620 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2024-11-09 02:18:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:10,626 INFO L225 Difference]: With dead ends: 211 [2024-11-09 02:18:10,627 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 02:18:10,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 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-09 02:18:10,628 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 421 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-09 02:18:10,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:18:10,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 02:18:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 02:18:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:18:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2024-11-09 02:18:10,643 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 119 [2024-11-09 02:18:10,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:10,644 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2024-11-09 02:18:10,644 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:10,644 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2024-11-09 02:18:10,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 02:18:10,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:10,649 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:10,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-09 02:18:10,850 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-09 02:18:10,850 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:10,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:10,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1837726192, now seen corresponding path program 1 times [2024-11-09 02:18:10,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:18:10,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398325284] [2024-11-09 02:18:10,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:10,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:10,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:18:10,854 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-09 02:18:10,855 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-09 02:18:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:18:11,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:18:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:18:11,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:18:11,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:18:11,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398325284] [2024-11-09 02:18:11,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398325284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:11,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:18:11,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183245308] [2024-11-09 02:18:11,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:11,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:18:11,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:18:11,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:18:11,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:18:11,151 INFO L87 Difference]: Start difference. First operand 108 states and 150 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:11,255 INFO L93 Difference]: Finished difference Result 216 states and 301 transitions. [2024-11-09 02:18:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:18:11,256 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2024-11-09 02:18:11,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:11,257 INFO L225 Difference]: With dead ends: 216 [2024-11-09 02:18:11,257 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 02:18:11,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:18:11,258 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:11,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 557 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:18:11,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 02:18:11,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2024-11-09 02:18:11,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:18:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 151 transitions. [2024-11-09 02:18:11,270 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 151 transitions. Word has length 121 [2024-11-09 02:18:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:11,271 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 151 transitions. [2024-11-09 02:18:11,271 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:11,271 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 151 transitions. [2024-11-09 02:18:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:18:11,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:11,274 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:11,283 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 (5)] Forceful destruction successful, exit code 0 [2024-11-09 02:18:11,474 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-09 02:18:11,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:11,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1128935945, now seen corresponding path program 1 times [2024-11-09 02:18:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:18:11,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110095480] [2024-11-09 02:18:11,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:11,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:11,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:18:11,479 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-09 02:18:11,480 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-09 02:18:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:11,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:18:11,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:18:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:18:11,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:18:11,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:18:11,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110095480] [2024-11-09 02:18:11,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110095480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:11,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:11,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:18:11,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746951423] [2024-11-09 02:18:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:11,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:18:11,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:18:11,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:18:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:18:11,777 INFO L87 Difference]: Start difference. First operand 109 states and 151 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:14,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:18:14,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:14,746 INFO L93 Difference]: Finished difference Result 210 states and 292 transitions. [2024-11-09 02:18:14,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:18:14,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:18:14,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:14,748 INFO L225 Difference]: With dead ends: 210 [2024-11-09 02:18:14,748 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 02:18:14,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 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-09 02:18:14,749 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:14,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 02:18:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 02:18:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-09 02:18:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:18:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2024-11-09 02:18:14,758 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 123 [2024-11-09 02:18:14,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:14,759 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2024-11-09 02:18:14,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2024-11-09 02:18:14,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:18:14,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:14,760 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:14,770 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 (6)] Forceful destruction successful, exit code 0 [2024-11-09 02:18:14,963 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-09 02:18:14,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:14,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1771764727, now seen corresponding path program 1 times [2024-11-09 02:18:14,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:18:14,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875121207] [2024-11-09 02:18:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:14,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:14,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:18:14,972 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-09 02:18:14,973 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-09 02:18:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:18:15,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:18:15,229 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:18:15,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:18:15,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:18:15,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875121207] [2024-11-09 02:18:15,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875121207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:15,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:15,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:18:15,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388485500] [2024-11-09 02:18:15,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:15,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:18:15,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:18:15,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:18:15,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:18:15,231 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:15,318 INFO L93 Difference]: Finished difference Result 208 states and 287 transitions. [2024-11-09 02:18:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:18:15,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:18:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:15,320 INFO L225 Difference]: With dead ends: 208 [2024-11-09 02:18:15,320 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 02:18:15,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 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-09 02:18:15,321 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 403 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.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:15,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 403 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:18:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 02:18:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-09 02:18:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:18:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 145 transitions. [2024-11-09 02:18:15,331 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 145 transitions. Word has length 123 [2024-11-09 02:18:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 145 transitions. [2024-11-09 02:18:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 145 transitions. [2024-11-09 02:18:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:18:15,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:15,333 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:15,343 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 (7)] Forceful destruction successful, exit code 0 [2024-11-09 02:18:15,533 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-09 02:18:15,534 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:15,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:15,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1843144199, now seen corresponding path program 1 times [2024-11-09 02:18:15,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:18:15,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114090002] [2024-11-09 02:18:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:15,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:15,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:18:15,539 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-09 02:18:15,540 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-09 02:18:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:15,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:18:15,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:18:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:18:15,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:18:15,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:18:15,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114090002] [2024-11-09 02:18:15,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114090002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:15,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:15,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:18:15,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588641091] [2024-11-09 02:18:15,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:15,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:18:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:18:15,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:18:15,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:18:15,788 INFO L87 Difference]: Start difference. First operand 106 states and 145 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:15,910 INFO L93 Difference]: Finished difference Result 212 states and 291 transitions. [2024-11-09 02:18:15,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:18:15,911 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:18:15,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:15,916 INFO L225 Difference]: With dead ends: 212 [2024-11-09 02:18:15,916 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 02:18:15,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:18:15,917 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:15,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 529 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:18:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 02:18:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-11-09 02:18:15,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:18:15,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2024-11-09 02:18:15,926 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 123 [2024-11-09 02:18:15,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:15,927 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2024-11-09 02:18:15,927 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, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2024-11-09 02:18:15,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:18:15,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:15,928 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:15,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 02:18:16,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:16,129 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:16,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:16,129 INFO L85 PathProgramCache]: Analyzing trace with hash -68136837, now seen corresponding path program 1 times [2024-11-09 02:18:16,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:18:16,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322565743] [2024-11-09 02:18:16,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:16,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:16,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:18:16,132 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:18:16,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 02:18:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:16,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 02:18:16,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:18:16,374 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:18:16,374 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:18:16,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:18:16,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322565743] [2024-11-09 02:18:16,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322565743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:16,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:16,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:18:16,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479350893] [2024-11-09 02:18:16,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:16,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:18:16,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:18:16,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:18:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:18:16,380 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:16,552 INFO L93 Difference]: Finished difference Result 216 states and 295 transitions. [2024-11-09 02:18:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:18:16,553 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:18:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:16,554 INFO L225 Difference]: With dead ends: 216 [2024-11-09 02:18:16,554 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 02:18:16,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:18:16,555 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:16,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 655 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:18:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 02:18:16,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-09 02:18:16,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 94 states have internal predecessors, (121), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:18:16,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 149 transitions. [2024-11-09 02:18:16,562 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 149 transitions. Word has length 123 [2024-11-09 02:18:16,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:16,562 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 149 transitions. [2024-11-09 02:18:16,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:16,563 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 149 transitions. [2024-11-09 02:18:16,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:18:16,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:16,564 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:16,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 02:18:16,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:16,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:16,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:16,765 INFO L85 PathProgramCache]: Analyzing trace with hash -66289795, now seen corresponding path program 1 times [2024-11-09 02:18:16,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:18:16,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687741193] [2024-11-09 02:18:16,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:16,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:16,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:18:16,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:18:16,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 02:18:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:17,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:18:17,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:18:17,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:18:17,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:18:17,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:18:17,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 41 [2024-11-09 02:18:17,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:18:17,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2024-11-09 02:18:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:18:17,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:18:17,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:18:17,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687741193] [2024-11-09 02:18:17,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687741193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:18:17,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:18:17,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:18:17,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115711230] [2024-11-09 02:18:17,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:18:17,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:18:17,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:18:17,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:18:17,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:18:17,569 INFO L87 Difference]: Start difference. First operand 110 states and 149 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:18:21,433 INFO L93 Difference]: Finished difference Result 325 states and 441 transitions. [2024-11-09 02:18:21,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:18:21,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2024-11-09 02:18:21,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:18:21,436 INFO L225 Difference]: With dead ends: 325 [2024-11-09 02:18:21,436 INFO L226 Difference]: Without dead ends: 218 [2024-11-09 02:18:21,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:18:21,437 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 104 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:18:21,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 415 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-09 02:18:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-09 02:18:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 184. [2024-11-09 02:18:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.2763157894736843) internal successors, (194), 152 states have internal predecessors, (194), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:18:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 250 transitions. [2024-11-09 02:18:21,464 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 250 transitions. Word has length 123 [2024-11-09 02:18:21,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:18:21,465 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 250 transitions. [2024-11-09 02:18:21,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:18:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 250 transitions. [2024-11-09 02:18:21,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:18:21,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:21,466 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:21,477 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 (10)] Ended with exit code 0 [2024-11-09 02:18:21,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:21,667 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:21,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1109371107, now seen corresponding path program 1 times [2024-11-09 02:18:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:18:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907735131] [2024-11-09 02:18:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:21,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:18:21,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:18:21,669 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:18:21,670 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 (11)] Waiting until timeout for monitored process [2024-11-09 02:18:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:22,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 02:18:22,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:18:26,379 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 8 treesize of output 1 [2024-11-09 02:18:27,357 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 12 treesize of output 8 [2024-11-09 02:18:28,516 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 24 treesize of output 12 [2024-11-09 02:18:29,500 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 21 treesize of output 20 [2024-11-09 02:18:30,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 46 [2024-11-09 02:18:31,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 72 [2024-11-09 02:18:31,594 INFO L349 Elim1Store]: treesize reduction 353, result has 5.6 percent of original size [2024-11-09 02:18:31,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 36 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 193 treesize of output 350 [2024-11-09 02:18:34,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2024-11-09 02:18:34,266 INFO L349 Elim1Store]: treesize reduction 190, result has 7.8 percent of original size [2024-11-09 02:18:34,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 102 [2024-11-09 02:18:34,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 75 [2024-11-09 02:18:35,232 INFO L349 Elim1Store]: treesize reduction 144, result has 17.7 percent of original size [2024-11-09 02:18:35,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 17 case distinctions, treesize of input 321 treesize of output 249 [2024-11-09 02:19:08,865 WARN L286 SmtUtils]: Spent 21.68s on a formula simplification that was a NOOP. DAG size: 1167 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 02:19:08,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:19:08,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 25 select indices, 25 select index equivalence classes, 21 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 1235 treesize of output 2899