./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.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 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:07:21,421 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:07:21,497 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:07:21,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:07:21,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:07:21,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:07:21,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:07:21,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:07:21,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:07:21,540 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:07:21,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:07:21,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:07:21,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:07:21,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:07:21,545 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:07:21,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:07:21,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:07:21,546 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:07:21,546 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:07:21,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:07:21,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:07:21,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:07:21,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:07:21,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:07:21,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:07:21,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:07:21,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:07:21,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:07:21,552 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:07:21,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:07:21,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:07:21,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:07:21,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:07:21,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:07:21,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:07:21,554 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:07:21,554 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:07:21,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:07:21,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:07:21,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:07:21,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:07:21,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:07:21,557 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 -> 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 [2024-11-20 09:07:21,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:07:21,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:07:21,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:07:21,866 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:07:21,867 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:07:21,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.i [2024-11-20 09:07:23,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:07:23,627 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:07:23,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.i [2024-11-20 09:07:23,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d6d6c6d/1841f99dd332436284068026b905fcf9/FLAG559d0f1e5 [2024-11-20 09:07:23,962 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34d6d6c6d/1841f99dd332436284068026b905fcf9 [2024-11-20 09:07:23,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:07:23,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:07:23,969 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:07:23,970 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:07:23,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:07:23,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:07:23" (1/1) ... [2024-11-20 09:07:23,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d720 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:23, skipping insertion in model container [2024-11-20 09:07:23,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:07:23" (1/1) ... [2024-11-20 09:07:24,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:07:24,196 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-41.i[917,930] [2024-11-20 09:07:24,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:07:24,264 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:07:24,275 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-41.i[917,930] [2024-11-20 09:07:24,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:07:24,340 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:07:24,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24 WrapperNode [2024-11-20 09:07:24,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:07:24,342 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:07:24,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:07:24,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:07:24,349 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,399 INFO L138 Inliner]: procedures = 30, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 410 [2024-11-20 09:07:24,400 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:07:24,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:07:24,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:07:24,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:07:24,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,418 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,425 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 09:07:24,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,444 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:07:24,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:07:24,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:07:24,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:07:24,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (1/1) ... [2024-11-20 09:07:24,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:07:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:07:24,517 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-20 09:07:24,524 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-20 09:07:24,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:07:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-20 09:07:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-20 09:07:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-20 09:07:24,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 09:07:24,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-20 09:07:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 09:07:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:07:24,577 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:07:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 09:07:24,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:07:24,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:07:24,733 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:07:24,735 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:07:25,243 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-20 09:07:25,244 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:07:25,263 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:07:25,265 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:07:25,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:07:25 BoogieIcfgContainer [2024-11-20 09:07:25,267 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:07:25,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:07:25,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:07:25,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:07:25,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:07:23" (1/3) ... [2024-11-20 09:07:25,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e403252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:07:25, skipping insertion in model container [2024-11-20 09:07:25,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:24" (2/3) ... [2024-11-20 09:07:25,276 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e403252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:07:25, skipping insertion in model container [2024-11-20 09:07:25,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:07:25" (3/3) ... [2024-11-20 09:07:25,278 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-41.i [2024-11-20 09:07:25,296 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:07:25,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:07:25,357 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:07:25,363 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;@7a7bb6f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:07:25,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:07:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 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-20 09:07:25,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 09:07:25,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:25,382 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] [2024-11-20 09:07:25,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:25,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:25,387 INFO L85 PathProgramCache]: Analyzing trace with hash 87027742, now seen corresponding path program 1 times [2024-11-20 09:07:25,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:07:25,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564975038] [2024-11-20 09:07:25,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:25,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:07:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:07:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:07:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:07:25,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:07:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:07:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:07:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:07:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:07:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:07:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:07:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:07:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:07:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:07:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:25,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:07:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,005 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-20 09:07:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:07:26,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564975038] [2024-11-20 09:07:26,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564975038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:26,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:26,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:07:26,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246180529] [2024-11-20 09:07:26,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:26,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:07:26,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:07:26,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:07:26,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:07:26,038 INFO L87 Difference]: Start difference. First operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:07:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:26,070 INFO L93 Difference]: Finished difference Result 167 states and 260 transitions. [2024-11-20 09:07:26,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:07:26,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-20 09:07:26,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:26,083 INFO L225 Difference]: With dead ends: 167 [2024-11-20 09:07:26,084 INFO L226 Difference]: Without dead ends: 81 [2024-11-20 09:07:26,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-20 09:07:26,092 INFO L432 NwaCegarLoop]: 115 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, 115 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-20 09:07:26,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:07:26,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-20 09:07:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-20 09:07:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 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-20 09:07:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-20 09:07:26,143 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2024-11-20 09:07:26,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:26,144 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-20 09:07:26,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 09:07:26,144 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-20 09:07:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 09:07:26,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:26,147 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] [2024-11-20 09:07:26,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:07:26,148 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:26,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:26,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1324648994, now seen corresponding path program 1 times [2024-11-20 09:07:26,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:07:26,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822291980] [2024-11-20 09:07:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:26,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:07:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:07:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:07:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:07:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:07:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:07:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:07:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:07:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:07:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:07:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:07:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:07:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:07:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:07:26,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:07:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:26,596 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-20 09:07:26,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:07:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822291980] [2024-11-20 09:07:26,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822291980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:26,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:26,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:07:26,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773150238] [2024-11-20 09:07:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:26,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:07:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:07:26,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:07:26,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:07:26,605 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-20 09:07:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:26,662 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2024-11-20 09:07:26,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:07:26,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 114 [2024-11-20 09:07:26,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:26,669 INFO L225 Difference]: With dead ends: 162 [2024-11-20 09:07:26,670 INFO L226 Difference]: Without dead ends: 84 [2024-11-20 09:07:26,671 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-20 09:07:26,672 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 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-20 09:07:26,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:07:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-20 09:07:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-20 09:07:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 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-20 09:07:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-20 09:07:26,689 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 114 [2024-11-20 09:07:26,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:26,692 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-20 09:07:26,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-20 09:07:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-20 09:07:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 09:07:26,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:26,696 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] [2024-11-20 09:07:26,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:07:26,696 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:26,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:26,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2004707364, now seen corresponding path program 1 times [2024-11-20 09:07:26,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:07:26,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114572823] [2024-11-20 09:07:26,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:07:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:07:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:07:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:07:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:07:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:07:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:07:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:07:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:07:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:07:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:07:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:07:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:07:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:07:27,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:07:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:27,484 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-20 09:07:27,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:07:27,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114572823] [2024-11-20 09:07:27,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114572823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:27,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:27,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:07:27,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195146158] [2024-11-20 09:07:27,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:27,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:07:27,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:07:27,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:07:27,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:07:27,491 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-20 09:07:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:27,850 INFO L93 Difference]: Finished difference Result 191 states and 269 transitions. [2024-11-20 09:07:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:07:27,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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 114 [2024-11-20 09:07:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:27,853 INFO L225 Difference]: With dead ends: 191 [2024-11-20 09:07:27,853 INFO L226 Difference]: Without dead ends: 111 [2024-11-20 09:07:27,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:07:27,855 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 120 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:07:27,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 378 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:07:27,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-20 09:07:27,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2024-11-20 09:07:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 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-20 09:07:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2024-11-20 09:07:27,866 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 114 [2024-11-20 09:07:27,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:27,867 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2024-11-20 09:07:27,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 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-20 09:07:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2024-11-20 09:07:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-20 09:07:27,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:27,869 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] [2024-11-20 09:07:27,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:07:27,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:27,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash 299123064, now seen corresponding path program 1 times [2024-11-20 09:07:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:07:27,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377461248] [2024-11-20 09:07:27,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:27,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:07:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:07:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:07:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:07:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:07:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:07:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:07:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:07:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:07:28,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 09:07:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 09:07:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:07:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 09:07:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 09:07:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 09:07:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:28,162 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-20 09:07:28,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:07:28,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377461248] [2024-11-20 09:07:28,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377461248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:28,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:28,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:07:28,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791431248] [2024-11-20 09:07:28,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:28,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:07:28,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:07:28,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:07:28,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:07:28,168 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 09:07:28,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:28,183 INFO L93 Difference]: Finished difference Result 162 states and 227 transitions. [2024-11-20 09:07:28,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:07:28,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 115 [2024-11-20 09:07:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:28,188 INFO L225 Difference]: With dead ends: 162 [2024-11-20 09:07:28,188 INFO L226 Difference]: Without dead ends: 78 [2024-11-20 09:07:28,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:07:28,193 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:07:28,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:07:28,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-20 09:07:28,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-20 09:07:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 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-20 09:07:28,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-11-20 09:07:28,211 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 115 [2024-11-20 09:07:28,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:28,212 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-20 09:07:28,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 09:07:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-11-20 09:07:28,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 09:07:28,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:28,216 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] [2024-11-20 09:07:28,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:07:28,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:28,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:28,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1431064419, now seen corresponding path program 1 times [2024-11-20 09:07:28,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:07:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381747265] [2024-11-20 09:07:28,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:07:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:07:28,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:07:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:07:28,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:07:28,672 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:07:28,673 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 09:07:28,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:07:28,680 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-20 09:07:28,816 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:07:28,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:07:28 BoogieIcfgContainer [2024-11-20 09:07:28,820 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:07:28,821 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:07:28,821 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:07:28,821 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:07:28,822 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:07:25" (3/4) ... [2024-11-20 09:07:28,824 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 09:07:28,827 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:07:28,828 INFO L158 Benchmark]: Toolchain (without parser) took 4861.11ms. Allocated memory was 153.1MB in the beginning and 192.9MB in the end (delta: 39.8MB). Free memory was 80.4MB in the beginning and 120.4MB in the end (delta: -40.0MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2024-11-20 09:07:28,828 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:07:28,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.63ms. Allocated memory is still 153.1MB. Free memory was 80.3MB in the beginning and 119.5MB in the end (delta: -39.2MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-20 09:07:28,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.62ms. Allocated memory is still 153.1MB. Free memory was 119.5MB in the beginning and 116.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 09:07:28,833 INFO L158 Benchmark]: Boogie Preprocessor took 55.28ms. Allocated memory is still 153.1MB. Free memory was 116.1MB in the beginning and 113.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 09:07:28,833 INFO L158 Benchmark]: RCFGBuilder took 807.52ms. Allocated memory is still 153.1MB. Free memory was 113.2MB in the beginning and 81.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-20 09:07:28,833 INFO L158 Benchmark]: TraceAbstraction took 3551.62ms. Allocated memory was 153.1MB in the beginning and 192.9MB in the end (delta: 39.8MB). Free memory was 80.5MB in the beginning and 120.4MB in the end (delta: -39.9MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. [2024-11-20 09:07:28,833 INFO L158 Benchmark]: Witness Printer took 6.58ms. Allocated memory is still 192.9MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:07:28,835 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.63ms. Allocated memory is still 153.1MB. Free memory was 80.3MB in the beginning and 119.5MB in the end (delta: -39.2MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.62ms. Allocated memory is still 153.1MB. Free memory was 119.5MB in the beginning and 116.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.28ms. Allocated memory is still 153.1MB. Free memory was 116.1MB in the beginning and 113.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 807.52ms. Allocated memory is still 153.1MB. Free memory was 113.2MB in the beginning and 81.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3551.62ms. Allocated memory was 153.1MB in the beginning and 192.9MB in the end (delta: 39.8MB). Free memory was 80.5MB in the beginning and 120.4MB in the end (delta: -39.9MB). Peak memory consumption was 71.0MB. Max. memory is 16.1GB. * Witness Printer took 6.58ms. Allocated memory is still 192.9MB. Free memory is still 120.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryArithmeticDOUBLEoperation at line 70. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L51] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L53] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L54] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L55] unsigned short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L56] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L57] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L58] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L59] signed long int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L60] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L61] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L62] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L63] signed char last_1_WrapperStruct00_var_1_1 = -16; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=0, last_1_WrapperStruct00_var_1_1=-16] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L121] EXPR WrapperStruct00.var_1_1 [L121] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L98] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L101] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L102] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L104] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L105] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L109] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L110] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_13 [L111] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_13 [L111] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L111] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L114] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L115] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L116] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L132] RET updateVariables() [L133] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L67] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) [L68] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L68] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L70] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L70] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3) [L71] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L71] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)); [L72] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16, stepLocal_1=1] [L72] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) && stepLocal_1 [L73] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L73] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L77] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L78] (*(WrapperStruct00_var_1_8_Pointer)) = ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) [L86] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L86] unsigned long int stepLocal_0 = ((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer)); [L87] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16, stepLocal_0=0] [L87] COND FALSE !(stepLocal_0 > (*(WrapperStruct00_var_1_8_Pointer))) [L94] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L94] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer)))) [L124] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L124] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))))) [L124] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))) [L124] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L124] EXPR (*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3))) [L124] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L124] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3)))) && (((*(WrapperStruct00_var_1_5_Pointer)) && ((*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR ((((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3)))) && (((*(WrapperStruct00_var_1_5_Pointer)) && ((*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_15_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124-L125] return ((((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3)))) && (((*(WrapperStruct00_var_1_5_Pointer)) && ((*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_15_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))) : 1) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 1029 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 578 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 451 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 4 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 573 NumberOfCodeBlocks, 573 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 791 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1456/1456 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-20 09:07:28,866 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.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 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:07:31,109 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:07:31,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 09:07:31,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:07:31,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:07:31,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:07:31,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:07:31,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:07:31,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:07:31,231 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:07:31,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:07:31,232 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:07:31,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:07:31,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:07:31,234 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:07:31,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:07:31,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:07:31,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:07:31,236 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:07:31,236 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:07:31,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:07:31,237 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:07:31,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:07:31,238 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 09:07:31,238 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 09:07:31,239 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:07:31,239 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 09:07:31,239 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:07:31,240 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:07:31,240 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:07:31,240 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:07:31,240 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:07:31,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:07:31,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:07:31,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:07:31,241 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:07:31,242 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:07:31,242 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:07:31,242 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 09:07:31,242 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 09:07:31,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:07:31,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:07:31,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:07:31,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:07:31,244 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 -> 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 [2024-11-20 09:07:31,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:07:31,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:07:31,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:07:31,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:07:31,634 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:07:31,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.i [2024-11-20 09:07:33,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:07:33,471 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:07:33,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.i [2024-11-20 09:07:33,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f473e2bb7/0cb19f74552041cb9bdd645899810df2/FLAG57368f0d0 [2024-11-20 09:07:33,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f473e2bb7/0cb19f74552041cb9bdd645899810df2 [2024-11-20 09:07:33,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:07:33,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:07:33,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:07:33,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:07:33,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:07:33,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:33,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12777b25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33, skipping insertion in model container [2024-11-20 09:07:33,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:33,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:07:33,750 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-41.i[917,930] [2024-11-20 09:07:33,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:07:33,855 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:07:33,868 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-41.i[917,930] [2024-11-20 09:07:33,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:07:33,959 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:07:33,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33 WrapperNode [2024-11-20 09:07:33,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:07:33,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:07:33,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:07:33,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:07:33,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:33,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:34,032 INFO L138 Inliner]: procedures = 37, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 406 [2024-11-20 09:07:34,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:07:34,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:07:34,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:07:34,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:07:34,044 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:34,045 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:34,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:34,073 INFO L175 MemorySlicer]: Split 112 memory accesses to 2 slices as follows [2, 110]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 30 writes are split as follows [0, 30]. [2024-11-20 09:07:34,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:34,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:34,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:34,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:34,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:34,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:34,132 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:07:34,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:07:34,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:07:34,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:07:34,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (1/1) ... [2024-11-20 09:07:34,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:07:34,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:07:34,168 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-20 09:07:34,172 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-20 09:07:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:07:34,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-20 09:07:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-20 09:07:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-20 09:07:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-20 09:07:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-20 09:07:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-20 09:07:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 09:07:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 09:07:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 09:07:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 09:07:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 09:07:34,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 09:07:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-20 09:07:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-20 09:07:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-20 09:07:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-20 09:07:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-20 09:07:34,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-20 09:07:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-20 09:07:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-20 09:07:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:07:34,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:07:34,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:07:34,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:07:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 09:07:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 09:07:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-20 09:07:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-20 09:07:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 09:07:34,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 09:07:34,375 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:07:34,378 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:07:35,560 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-20 09:07:35,560 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:07:35,591 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:07:35,593 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:07:35,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:07:35 BoogieIcfgContainer [2024-11-20 09:07:35,593 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:07:35,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:07:35,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:07:35,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:07:35,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:07:33" (1/3) ... [2024-11-20 09:07:35,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c0efaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:07:35, skipping insertion in model container [2024-11-20 09:07:35,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:07:33" (2/3) ... [2024-11-20 09:07:35,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c0efaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:07:35, skipping insertion in model container [2024-11-20 09:07:35,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:07:35" (3/3) ... [2024-11-20 09:07:35,603 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-41.i [2024-11-20 09:07:35,619 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:07:35,620 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:07:35,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:07:35,704 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;@9d2b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:07:35,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:07:35,710 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 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-20 09:07:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 09:07:35,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:35,726 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] [2024-11-20 09:07:35,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:35,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1210687020, now seen corresponding path program 1 times [2024-11-20 09:07:35,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:07:35,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98040696] [2024-11-20 09:07:35,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:35,750 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-20 09:07:35,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:07:35,753 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-20 09:07:35,755 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-20 09:07:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:36,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 09:07:36,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:07:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-20 09:07:36,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:07:36,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:07:36,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98040696] [2024-11-20 09:07:36,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98040696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:36,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:07:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26169520] [2024-11-20 09:07:36,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:36,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:07:36,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:07:36,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:07:36,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:07:36,271 INFO L87 Difference]: Start difference. First operand has 89 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 73 states have internal predecessors, (101), 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-20 09:07:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:36,307 INFO L93 Difference]: Finished difference Result 167 states and 260 transitions. [2024-11-20 09:07:36,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:07:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 114 [2024-11-20 09:07:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:36,318 INFO L225 Difference]: With dead ends: 167 [2024-11-20 09:07:36,319 INFO L226 Difference]: Without dead ends: 81 [2024-11-20 09:07:36,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-20 09:07:36,329 INFO L432 NwaCegarLoop]: 115 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, 115 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-20 09:07:36,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:07:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-20 09:07:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-20 09:07:36,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 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-20 09:07:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-20 09:07:36,384 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2024-11-20 09:07:36,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:36,385 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-20 09:07:36,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-20 09:07:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-20 09:07:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 09:07:36,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:36,388 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] [2024-11-20 09:07:36,408 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-20 09:07:36,593 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-20 09:07:36,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:36,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash 26934232, now seen corresponding path program 1 times [2024-11-20 09:07:36,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:07:36,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615446268] [2024-11-20 09:07:36,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:36,595 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-20 09:07:36,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:07:36,600 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-20 09:07:36,602 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-20 09:07:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:36,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 09:07:36,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:07:37,033 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-20 09:07:37,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:07:37,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:07:37,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615446268] [2024-11-20 09:07:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615446268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:37,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:37,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:07:37,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589715548] [2024-11-20 09:07:37,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:37,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:07:37,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:07:37,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:07:37,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:07:37,042 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-20 09:07:37,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:37,317 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2024-11-20 09:07:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:07:37,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 114 [2024-11-20 09:07:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:37,320 INFO L225 Difference]: With dead ends: 162 [2024-11-20 09:07:37,320 INFO L226 Difference]: Without dead ends: 84 [2024-11-20 09:07:37,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 111 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-20 09:07:37,322 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 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.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:07:37,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:07:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-20 09:07:37,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-20 09:07:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 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-20 09:07:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-20 09:07:37,344 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 114 [2024-11-20 09:07:37,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:37,345 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-20 09:07:37,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-20 09:07:37,346 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-20 09:07:37,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 09:07:37,348 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:37,348 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] [2024-11-20 09:07:37,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 09:07:37,548 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-20 09:07:37,549 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:37,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:37,550 INFO L85 PathProgramCache]: Analyzing trace with hash 706992602, now seen corresponding path program 1 times [2024-11-20 09:07:37,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:07:37,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917596301] [2024-11-20 09:07:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:37,551 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-20 09:07:37,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:07:37,554 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-20 09:07:37,556 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-20 09:07:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:37,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 09:07:37,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:07:38,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:07:38,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-20 09:07:38,300 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-20 09:07:38,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:07:38,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:07:38,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917596301] [2024-11-20 09:07:38,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917596301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:38,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:38,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:07:38,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258374274] [2024-11-20 09:07:38,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:38,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:07:38,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:07:38,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:07:38,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:07:38,305 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-20 09:07:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:39,303 INFO L93 Difference]: Finished difference Result 164 states and 232 transitions. [2024-11-20 09:07:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:07:39,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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 114 [2024-11-20 09:07:39,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:39,305 INFO L225 Difference]: With dead ends: 164 [2024-11-20 09:07:39,307 INFO L226 Difference]: Without dead ends: 84 [2024-11-20 09:07:39,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-20 09:07:39,311 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 82 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 09:07:39,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 342 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 09:07:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-20 09:07:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2024-11-20 09:07:39,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 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-20 09:07:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 116 transitions. [2024-11-20 09:07:39,321 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 116 transitions. Word has length 114 [2024-11-20 09:07:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:39,321 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 116 transitions. [2024-11-20 09:07:39,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 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-20 09:07:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 116 transitions. [2024-11-20 09:07:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 09:07:39,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:39,323 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] [2024-11-20 09:07:39,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 09:07:39,524 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-20 09:07:39,525 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:39,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash 184993312, now seen corresponding path program 1 times [2024-11-20 09:07:39,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:07:39,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932905976] [2024-11-20 09:07:39,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:39,526 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-20 09:07:39,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:07:39,530 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-20 09:07:39,531 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-20 09:07:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:39,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-20 09:07:39,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:07:41,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:07:43,101 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 31 treesize of output 26 [2024-11-20 09:07:44,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-20 09:07:45,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2024-11-20 09:07:48,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 59 [2024-11-20 09:07:50,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2024-11-20 09:07:51,447 INFO L349 Elim1Store]: treesize reduction 91, result has 14.2 percent of original size [2024-11-20 09:07:51,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 97 [2024-11-20 09:07:51,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 93 [2024-11-20 09:07:54,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 96 [2024-11-20 09:07:57,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 109 [2024-11-20 09:07:57,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 123 [2024-11-20 09:07:57,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:07:57,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 144 treesize of output 80 [2024-11-20 09:07:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 190 proven. 144 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-20 09:07:57,848 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:07:58,051 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-20 09:07:58,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:07:58,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932905976] [2024-11-20 09:07:58,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932905976] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 09:07:58,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 09:07:58,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 25 [2024-11-20 09:07:58,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373164186] [2024-11-20 09:07:58,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:58,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:07:58,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:07:58,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:07:58,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=513, Unknown=3, NotChecked=0, Total=600 [2024-11-20 09:07:58,055 INFO L87 Difference]: Start difference. First operand 83 states and 116 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-20 09:07:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:58,906 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2024-11-20 09:07:58,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:07:58,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 116 [2024-11-20 09:07:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:58,909 INFO L225 Difference]: With dead ends: 191 [2024-11-20 09:07:58,909 INFO L226 Difference]: Without dead ends: 111 [2024-11-20 09:07:58,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=92, Invalid=607, Unknown=3, NotChecked=0, Total=702 [2024-11-20 09:07:58,911 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 35 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 09:07:58,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 409 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 09:07:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-20 09:07:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2024-11-20 09:07:58,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-20 09:07:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 120 transitions. [2024-11-20 09:07:58,922 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 120 transitions. Word has length 116 [2024-11-20 09:07:58,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:58,923 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 120 transitions. [2024-11-20 09:07:58,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-20 09:07:58,924 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 120 transitions. [2024-11-20 09:07:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 09:07:58,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:58,926 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] [2024-11-20 09:07:58,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 (5)] Ended with exit code 0 [2024-11-20 09:07:59,126 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-20 09:07:59,127 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:59,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:59,127 INFO L85 PathProgramCache]: Analyzing trace with hash -277437692, now seen corresponding path program 1 times [2024-11-20 09:07:59,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:07:59,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614187574] [2024-11-20 09:07:59,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:59,128 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-20 09:07:59,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:07:59,132 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-20 09:07:59,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 (6)] Waiting until timeout for monitored process [2024-11-20 09:07:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:07:59,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 09:07:59,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:07:59,393 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-20 09:07:59,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:07:59,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:07:59,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614187574] [2024-11-20 09:07:59,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614187574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:07:59,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:07:59,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:07:59,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791220200] [2024-11-20 09:07:59,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:07:59,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:07:59,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:07:59,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:07:59,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:07:59,396 INFO L87 Difference]: Start difference. First operand 87 states and 120 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-20 09:07:59,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:07:59,416 INFO L93 Difference]: Finished difference Result 162 states and 225 transitions. [2024-11-20 09:07:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:07:59,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 117 [2024-11-20 09:07:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:07:59,418 INFO L225 Difference]: With dead ends: 162 [2024-11-20 09:07:59,419 INFO L226 Difference]: Without dead ends: 78 [2024-11-20 09:07:59,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:07:59,420 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:07:59,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:07:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-20 09:07:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-20 09:07:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 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-20 09:07:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2024-11-20 09:07:59,432 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 117 [2024-11-20 09:07:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:07:59,433 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-11-20 09:07:59,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-20 09:07:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2024-11-20 09:07:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-20 09:07:59,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:07:59,438 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] [2024-11-20 09:07:59,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 09:07:59,639 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-20 09:07:59,639 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:07:59,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:07:59,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2124578663, now seen corresponding path program 1 times [2024-11-20 09:07:59,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:07:59,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498705146] [2024-11-20 09:07:59,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:07:59,641 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-20 09:07:59,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:07:59,644 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-20 09:07:59,645 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-20 09:08:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:08:13,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-20 09:08:13,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:08:17,314 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-20 09:08:19,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 61 [2024-11-20 09:08:21,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 64 [2024-11-20 09:08:23,380 INFO L349 Elim1Store]: treesize reduction 55, result has 21.4 percent of original size [2024-11-20 09:08:23,381 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 88 [2024-11-20 09:08:23,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 118 [2024-11-20 09:08:31,221 WARN L286 SmtUtils]: Spent 5.89s on a formula simplification. DAG size of input: 106 DAG size of output: 86 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-20 09:08:31,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 124 [2024-11-20 09:08:35,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 137 [2024-11-20 09:08:40,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 142 [2024-11-20 09:08:49,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:08:49,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 352 treesize of output 164