./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-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:56:56,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:56:56,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:56:57,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:56:57,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:56:57,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:56:57,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:56:57,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:56:57,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:56:57,031 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:56:57,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:56:57,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:56:57,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:56:57,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:56:57,034 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:56:57,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:56:57,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:56:57,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:56:57,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:56:57,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:56:57,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:56:57,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:56:57,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:56:57,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:56:57,038 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:56:57,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:56:57,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:56:57,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:56:57,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:56:57,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:56:57,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:56:57,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:56:57,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:56:57,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:56:57,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:56:57,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:56:57,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:56:57,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:56:57,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:56:57,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:56:57,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:56:57,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:56:57,041 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-clean/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-clean/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 -> 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 [2024-10-11 13:56:57,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:56:57,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:56:57,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:56:57,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:56:57,269 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:56:57,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-10-11 13:56:58,466 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:56:58,623 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:56:58,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-10-11 13:56:58,632 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd11bf0af/8b5fb054f178472b94c145171c3c48b9/FLAG8fa67eff0 [2024-10-11 13:56:58,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd11bf0af/8b5fb054f178472b94c145171c3c48b9 [2024-10-11 13:56:58,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:56:58,649 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:56:58,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:56:58,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:56:58,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:56:58,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:58,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5165cb2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58, skipping insertion in model container [2024-10-11 13:56:58,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:58,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:56:58,820 WARN L248 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-23.i[917,930] [2024-10-11 13:56:58,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:56:58,872 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:56:58,880 WARN L248 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-23.i[917,930] [2024-10-11 13:56:58,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:56:58,928 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:56:58,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58 WrapperNode [2024-10-11 13:56:58,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:56:58,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:56:58,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:56:58,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:56:58,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:58,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:58,972 INFO L138 Inliner]: procedures = 29, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 552 [2024-10-11 13:56:58,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:56:58,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:56:58,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:56:58,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:56:58,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:58,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:58,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:59,009 INFO L175 MemorySlicer]: Split 146 memory accesses to 2 slices as follows [2, 144]. 99 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 17]. The 18 writes are split as follows [0, 18]. [2024-10-11 13:56:59,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:59,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:59,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:59,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:59,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:59,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:59,040 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:56:59,041 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:56:59,041 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:56:59,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:56:59,042 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (1/1) ... [2024-10-11 13:56:59,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:56:59,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:56:59,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:56:59,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:56:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:56:59,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:56:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:56:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:56:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:56:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:56:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:56:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:56:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:56:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:56:59,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:56:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:56:59,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:56:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:56:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:56:59,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:56:59,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:56:59,208 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:56:59,210 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:56:59,657 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-10-11 13:56:59,657 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:56:59,692 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:56:59,693 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:56:59,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:56:59 BoogieIcfgContainer [2024-10-11 13:56:59,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:56:59,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:56:59,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:56:59,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:56:59,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:56:58" (1/3) ... [2024-10-11 13:56:59,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b180cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:56:59, skipping insertion in model container [2024-10-11 13:56:59,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:56:58" (2/3) ... [2024-10-11 13:56:59,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b180cdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:56:59, skipping insertion in model container [2024-10-11 13:56:59,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:56:59" (3/3) ... [2024-10-11 13:56:59,701 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-23.i [2024-10-11 13:56:59,712 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:56:59,713 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:56:59,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:56:59,771 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;@5145241d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:56:59,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:56:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:56:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:56:59,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:56:59,789 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:56:59,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:56:59,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:56:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1505185099, now seen corresponding path program 1 times [2024-10-11 13:56:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:56:59,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74144412] [2024-10-11 13:56:59,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:56:59,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:56:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:00,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:00,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74144412] [2024-10-11 13:57:00,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74144412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:00,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:00,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:57:00,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588720210] [2024-10-11 13:57:00,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:00,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:57:00,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:00,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:57:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:57:00,161 INFO L87 Difference]: Start difference. First operand has 117 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:00,210 INFO L93 Difference]: Finished difference Result 231 states and 370 transitions. [2024-10-11 13:57:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:57:00,216 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2024-10-11 13:57:00,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:00,224 INFO L225 Difference]: With dead ends: 231 [2024-10-11 13:57:00,225 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 13:57:00,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-10-11 13:57:00,232 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 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-10-11 13:57:00,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:57:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 13:57:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 13:57:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:00,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2024-10-11 13:57:00,287 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 160 [2024-10-11 13:57:00,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:00,287 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2024-10-11 13:57:00,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2024-10-11 13:57:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:57:00,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:00,292 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:00,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:57:00,292 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:00,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:00,293 INFO L85 PathProgramCache]: Analyzing trace with hash -615857535, now seen corresponding path program 1 times [2024-10-11 13:57:00,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:00,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084274822] [2024-10-11 13:57:00,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:00,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:02,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:02,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084274822] [2024-10-11 13:57:02,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084274822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:02,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:02,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:57:02,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453971957] [2024-10-11 13:57:02,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:02,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:57:02,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:02,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:57:02,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:57:02,359 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:03,100 INFO L93 Difference]: Finished difference Result 275 states and 409 transitions. [2024-10-11 13:57:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:57:03,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2024-10-11 13:57:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:03,102 INFO L225 Difference]: With dead ends: 275 [2024-10-11 13:57:03,102 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 13:57:03,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:57:03,104 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 242 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:03,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 593 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:57:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 13:57:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 130. [2024-10-11 13:57:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.4259259259259258) internal successors, (154), 108 states have internal predecessors, (154), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:03,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2024-10-11 13:57:03,133 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 160 [2024-10-11 13:57:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:03,134 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2024-10-11 13:57:03,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2024-10-11 13:57:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:57:03,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:03,136 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:03,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:57:03,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:03,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash -357692097, now seen corresponding path program 1 times [2024-10-11 13:57:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470665859] [2024-10-11 13:57:03,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:04,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:04,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470665859] [2024-10-11 13:57:04,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470665859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:04,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:04,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:57:04,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527802181] [2024-10-11 13:57:04,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:04,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:57:04,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:04,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:57:04,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:57:04,906 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:06,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:06,108 INFO L93 Difference]: Finished difference Result 326 states and 483 transitions. [2024-10-11 13:57:06,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:57:06,108 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2024-10-11 13:57:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:06,111 INFO L225 Difference]: With dead ends: 326 [2024-10-11 13:57:06,112 INFO L226 Difference]: Without dead ends: 197 [2024-10-11 13:57:06,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:57:06,115 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 324 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:06,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 780 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 13:57:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-11 13:57:06,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 130. [2024-10-11 13:57:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.4166666666666667) internal successors, (153), 108 states have internal predecessors, (153), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2024-10-11 13:57:06,138 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 160 [2024-10-11 13:57:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:06,139 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-10-11 13:57:06,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2024-10-11 13:57:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:57:06,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:06,142 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:06,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:57:06,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:06,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:06,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1873671427, now seen corresponding path program 1 times [2024-10-11 13:57:06,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:06,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769804296] [2024-10-11 13:57:06,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:06,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:07,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:07,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769804296] [2024-10-11 13:57:07,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769804296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:07,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:07,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:57:07,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577131865] [2024-10-11 13:57:07,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:07,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:57:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:07,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:57:07,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:57:07,892 INFO L87 Difference]: Start difference. First operand 130 states and 193 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:08,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:08,555 INFO L93 Difference]: Finished difference Result 301 states and 447 transitions. [2024-10-11 13:57:08,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:57:08,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-10-11 13:57:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:08,557 INFO L225 Difference]: With dead ends: 301 [2024-10-11 13:57:08,559 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 13:57:08,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:57:08,560 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 306 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:08,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 659 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:57:08,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 13:57:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 141. [2024-10-11 13:57:08,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2024-10-11 13:57:08,582 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 160 [2024-10-11 13:57:08,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:08,583 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2024-10-11 13:57:08,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:08,584 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2024-10-11 13:57:08,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:57:08,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:08,585 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:08,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:57:08,585 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:08,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:08,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2131836865, now seen corresponding path program 1 times [2024-10-11 13:57:08,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:08,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379122524] [2024-10-11 13:57:08,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:08,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:09,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:09,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:10,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:10,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379122524] [2024-10-11 13:57:10,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379122524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:10,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:10,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:57:10,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540946562] [2024-10-11 13:57:10,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:10,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:57:10,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:10,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:57:10,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:57:10,033 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:10,540 INFO L93 Difference]: Finished difference Result 312 states and 463 transitions. [2024-10-11 13:57:10,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:57:10,541 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2024-10-11 13:57:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:10,542 INFO L225 Difference]: With dead ends: 312 [2024-10-11 13:57:10,542 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 13:57:10,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:57:10,543 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 269 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:10,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 899 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:57:10,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 13:57:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 141. [2024-10-11 13:57:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.4285714285714286) internal successors, (170), 119 states have internal predecessors, (170), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:10,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 210 transitions. [2024-10-11 13:57:10,553 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 210 transitions. Word has length 160 [2024-10-11 13:57:10,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:10,553 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 210 transitions. [2024-10-11 13:57:10,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:10,553 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 210 transitions. [2024-10-11 13:57:10,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 13:57:10,554 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:10,555 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:10,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:57:10,555 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:10,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:10,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1547013780, now seen corresponding path program 1 times [2024-10-11 13:57:10,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:10,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651785132] [2024-10-11 13:57:10,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:10,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:14,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:14,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:14,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651785132] [2024-10-11 13:57:14,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651785132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:14,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:14,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 13:57:14,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245554965] [2024-10-11 13:57:14,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:14,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 13:57:14,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:14,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 13:57:14,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:57:14,436 INFO L87 Difference]: Start difference. First operand 141 states and 210 transitions. Second operand has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:18,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:57:21,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:57:25,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:57:33,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:57:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:37,007 INFO L93 Difference]: Finished difference Result 360 states and 531 transitions. [2024-10-11 13:57:37,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:57:37,010 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2024-10-11 13:57:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:37,011 INFO L225 Difference]: With dead ends: 360 [2024-10-11 13:57:37,011 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 13:57:37,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:57:37,012 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 653 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:37,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 687 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 930 Invalid, 1 Unknown, 0 Unchecked, 15.0s Time] [2024-10-11 13:57:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 13:57:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 150. [2024-10-11 13:57:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.4453125) internal successors, (185), 128 states have internal predecessors, (185), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2024-10-11 13:57:37,023 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 162 [2024-10-11 13:57:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:37,023 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2024-10-11 13:57:37,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2024-10-11 13:57:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 13:57:37,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:37,024 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:37,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:57:37,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:37,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:37,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1288848342, now seen corresponding path program 1 times [2024-10-11 13:57:37,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:37,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586733579] [2024-10-11 13:57:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:37,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:38,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:38,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:38,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586733579] [2024-10-11 13:57:38,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586733579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:38,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:38,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:57:38,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287763801] [2024-10-11 13:57:38,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:38,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:57:38,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:38,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:57:38,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:57:38,820 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:39,891 INFO L93 Difference]: Finished difference Result 365 states and 540 transitions. [2024-10-11 13:57:39,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:57:39,893 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2024-10-11 13:57:39,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:39,896 INFO L225 Difference]: With dead ends: 365 [2024-10-11 13:57:39,896 INFO L226 Difference]: Without dead ends: 216 [2024-10-11 13:57:39,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:57:39,897 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 533 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:39,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 479 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:57:39,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-11 13:57:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 150. [2024-10-11 13:57:39,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 128 states have (on average 1.4375) internal successors, (184), 128 states have internal predecessors, (184), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 224 transitions. [2024-10-11 13:57:39,913 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 224 transitions. Word has length 162 [2024-10-11 13:57:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:39,914 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 224 transitions. [2024-10-11 13:57:39,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 224 transitions. [2024-10-11 13:57:39,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 13:57:39,915 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:39,915 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:39,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:57:39,915 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:39,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1905229777, now seen corresponding path program 1 times [2024-10-11 13:57:39,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:39,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710467532] [2024-10-11 13:57:39,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:39,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:40,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:40,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710467532] [2024-10-11 13:57:40,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710467532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:40,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:40,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:57:40,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312823943] [2024-10-11 13:57:40,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:40,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:57:40,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:40,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:57:40,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:57:40,070 INFO L87 Difference]: Start difference. First operand 150 states and 224 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:40,119 INFO L93 Difference]: Finished difference Result 302 states and 451 transitions. [2024-10-11 13:57:40,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:57:40,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-10-11 13:57:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:40,120 INFO L225 Difference]: With dead ends: 302 [2024-10-11 13:57:40,120 INFO L226 Difference]: Without dead ends: 153 [2024-10-11 13:57:40,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:57:40,121 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:40,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 645 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:57:40,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-11 13:57:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-10-11 13:57:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 131 states have internal predecessors, (187), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 227 transitions. [2024-10-11 13:57:40,138 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 227 transitions. Word has length 162 [2024-10-11 13:57:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:40,138 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 227 transitions. [2024-10-11 13:57:40,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 227 transitions. [2024-10-11 13:57:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 13:57:40,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:40,140 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:40,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:57:40,140 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:40,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:40,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1124311954, now seen corresponding path program 1 times [2024-10-11 13:57:40,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:40,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034521708] [2024-10-11 13:57:40,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:40,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:41,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:41,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:41,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034521708] [2024-10-11 13:57:41,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034521708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:41,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:41,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:57:41,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594792864] [2024-10-11 13:57:41,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:41,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:57:41,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:41,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:57:41,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:57:41,358 INFO L87 Difference]: Start difference. First operand 153 states and 227 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:42,095 INFO L93 Difference]: Finished difference Result 341 states and 502 transitions. [2024-10-11 13:57:42,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:57:42,095 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2024-10-11 13:57:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:42,096 INFO L225 Difference]: With dead ends: 341 [2024-10-11 13:57:42,096 INFO L226 Difference]: Without dead ends: 189 [2024-10-11 13:57:42,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:57:42,097 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 384 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:42,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 651 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:57:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-11 13:57:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 144. [2024-10-11 13:57:42,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.4180327868852458) internal successors, (173), 122 states have internal predecessors, (173), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2024-10-11 13:57:42,108 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 162 [2024-10-11 13:57:42,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:42,109 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2024-10-11 13:57:42,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2024-10-11 13:57:42,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 13:57:42,110 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:42,110 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:42,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:57:42,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:42,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:42,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1067653372, now seen corresponding path program 1 times [2024-10-11 13:57:42,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:42,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36542279] [2024-10-11 13:57:42,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:42,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:43,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36542279] [2024-10-11 13:57:43,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36542279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:43,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:43,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:57:43,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430430502] [2024-10-11 13:57:43,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:43,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:57:43,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:43,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:57:43,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:57:43,200 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:43,702 INFO L93 Difference]: Finished difference Result 338 states and 497 transitions. [2024-10-11 13:57:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:57:43,703 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-10-11 13:57:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:43,704 INFO L225 Difference]: With dead ends: 338 [2024-10-11 13:57:43,704 INFO L226 Difference]: Without dead ends: 195 [2024-10-11 13:57:43,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:57:43,705 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 398 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:43,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 703 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:57:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-10-11 13:57:43,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2024-10-11 13:57:43,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 135 states have (on average 1.4370370370370371) internal successors, (194), 135 states have internal predecessors, (194), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:43,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 234 transitions. [2024-10-11 13:57:43,716 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 234 transitions. Word has length 162 [2024-10-11 13:57:43,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:43,716 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 234 transitions. [2024-10-11 13:57:43,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:43,716 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2024-10-11 13:57:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 13:57:43,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:43,717 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:43,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:57:43,717 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:43,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1325818810, now seen corresponding path program 1 times [2024-10-11 13:57:43,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:43,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003064941] [2024-10-11 13:57:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:43,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:45,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:45,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:45,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003064941] [2024-10-11 13:57:45,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003064941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:45,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:45,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 13:57:45,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361036812] [2024-10-11 13:57:45,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:45,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:57:45,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:45,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:57:45,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:57:45,107 INFO L87 Difference]: Start difference. First operand 157 states and 234 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:46,409 INFO L93 Difference]: Finished difference Result 397 states and 584 transitions. [2024-10-11 13:57:46,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:57:46,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2024-10-11 13:57:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:46,411 INFO L225 Difference]: With dead ends: 397 [2024-10-11 13:57:46,411 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 13:57:46,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2024-10-11 13:57:46,412 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 382 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:46,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 764 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 13:57:46,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 13:57:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 155. [2024-10-11 13:57:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.4360902255639099) internal successors, (191), 133 states have internal predecessors, (191), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 231 transitions. [2024-10-11 13:57:46,423 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 231 transitions. Word has length 162 [2024-10-11 13:57:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:46,424 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 231 transitions. [2024-10-11 13:57:46,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 231 transitions. [2024-10-11 13:57:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 13:57:46,425 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:46,425 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:46,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:57:46,425 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:46,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:46,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1406465170, now seen corresponding path program 1 times [2024-10-11 13:57:46,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:46,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570661184] [2024-10-11 13:57:46,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:46,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:47,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:47,780 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:47,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:47,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570661184] [2024-10-11 13:57:47,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570661184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:47,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:47,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:57:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314460040] [2024-10-11 13:57:47,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:47,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:57:47,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:47,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:57:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:57:47,782 INFO L87 Difference]: Start difference. First operand 155 states and 231 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:48,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:48,464 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2024-10-11 13:57:48,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:57:48,464 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-10-11 13:57:48,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:48,465 INFO L225 Difference]: With dead ends: 345 [2024-10-11 13:57:48,465 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 13:57:48,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:57:48,466 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 252 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:48,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 733 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:57:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 13:57:48,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2024-10-11 13:57:48,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 135 states have (on average 1.4296296296296296) internal successors, (193), 135 states have internal predecessors, (193), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2024-10-11 13:57:48,483 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 162 [2024-10-11 13:57:48,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:48,483 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2024-10-11 13:57:48,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2024-10-11 13:57:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 13:57:48,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:48,484 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:48,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:57:48,484 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:48,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:48,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1148299732, now seen corresponding path program 1 times [2024-10-11 13:57:48,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:48,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099330653] [2024-10-11 13:57:48,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:48,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:49,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:49,891 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:49,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:49,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099330653] [2024-10-11 13:57:49,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099330653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:49,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:49,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:57:49,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733405107] [2024-10-11 13:57:49,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:49,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:57:49,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:49,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:57:49,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:57:49,892 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:50,484 INFO L93 Difference]: Finished difference Result 347 states and 511 transitions. [2024-10-11 13:57:50,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:57:50,485 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-10-11 13:57:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:50,487 INFO L225 Difference]: With dead ends: 347 [2024-10-11 13:57:50,487 INFO L226 Difference]: Without dead ends: 191 [2024-10-11 13:57:50,487 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:57:50,491 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 266 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:50,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 970 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:57:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-11 13:57:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 155. [2024-10-11 13:57:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.4360902255639099) internal successors, (191), 133 states have internal predecessors, (191), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 231 transitions. [2024-10-11 13:57:50,503 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 231 transitions. Word has length 162 [2024-10-11 13:57:50,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:50,503 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 231 transitions. [2024-10-11 13:57:50,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 231 transitions. [2024-10-11 13:57:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 13:57:50,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:50,504 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:50,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:57:50,504 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:50,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1208201982, now seen corresponding path program 1 times [2024-10-11 13:57:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:50,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292978079] [2024-10-11 13:57:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:50,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:50,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:50,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:50,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292978079] [2024-10-11 13:57:50,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292978079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:50,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:50,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:57:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561132124] [2024-10-11 13:57:50,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:50,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:57:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:50,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:57:50,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:57:50,977 INFO L87 Difference]: Start difference. First operand 155 states and 231 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:51,227 INFO L93 Difference]: Finished difference Result 309 states and 461 transitions. [2024-10-11 13:57:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:57:51,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-10-11 13:57:51,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:51,229 INFO L225 Difference]: With dead ends: 309 [2024-10-11 13:57:51,229 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 13:57:51,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:57:51,230 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 125 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:51,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 454 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:57:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 13:57:51,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-10-11 13:57:51,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.4285714285714286) internal successors, (190), 133 states have internal predecessors, (190), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:51,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2024-10-11 13:57:51,243 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 162 [2024-10-11 13:57:51,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:51,244 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2024-10-11 13:57:51,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:51,244 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2024-10-11 13:57:51,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 13:57:51,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:51,246 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:51,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:57:51,246 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:51,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1427056700, now seen corresponding path program 1 times [2024-10-11 13:57:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:51,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374832321] [2024-10-11 13:57:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:52,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374832321] [2024-10-11 13:57:52,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374832321] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:52,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:52,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:57:52,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695739505] [2024-10-11 13:57:52,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:52,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:57:52,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:52,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:57:52,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:57:52,468 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:53,129 INFO L93 Difference]: Finished difference Result 355 states and 524 transitions. [2024-10-11 13:57:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:57:53,129 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2024-10-11 13:57:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:53,131 INFO L225 Difference]: With dead ends: 355 [2024-10-11 13:57:53,132 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 13:57:53,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:57:53,132 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 412 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:53,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 428 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:57:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 13:57:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 167. [2024-10-11 13:57:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 145 states have (on average 1.4137931034482758) internal successors, (205), 145 states have internal predecessors, (205), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:53,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 245 transitions. [2024-10-11 13:57:53,147 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 245 transitions. Word has length 162 [2024-10-11 13:57:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:53,148 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 245 transitions. [2024-10-11 13:57:53,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:53,148 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 245 transitions. [2024-10-11 13:57:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 13:57:53,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:53,148 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:53,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:57:53,148 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:53,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:53,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1685222138, now seen corresponding path program 1 times [2024-10-11 13:57:53,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:53,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491735638] [2024-10-11 13:57:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:53,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:54,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:54,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:54,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491735638] [2024-10-11 13:57:54,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491735638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:54,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:54,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:57:54,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265529415] [2024-10-11 13:57:54,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:54,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:57:54,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:54,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:57:54,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:57:54,228 INFO L87 Difference]: Start difference. First operand 167 states and 245 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:54,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:54,834 INFO L93 Difference]: Finished difference Result 369 states and 537 transitions. [2024-10-11 13:57:54,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:57:54,835 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2024-10-11 13:57:54,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:54,836 INFO L225 Difference]: With dead ends: 369 [2024-10-11 13:57:54,836 INFO L226 Difference]: Without dead ends: 203 [2024-10-11 13:57:54,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-11 13:57:54,837 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 218 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:54,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1067 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:57:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-11 13:57:54,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 165. [2024-10-11 13:57:54,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 143 states have (on average 1.4195804195804196) internal successors, (203), 143 states have internal predecessors, (203), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2024-10-11 13:57:54,851 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 162 [2024-10-11 13:57:54,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:54,851 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2024-10-11 13:57:54,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2024-10-11 13:57:54,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 13:57:54,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:54,852 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:54,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:57:54,853 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:54,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:54,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1601071348, now seen corresponding path program 1 times [2024-10-11 13:57:54,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:54,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151144507] [2024-10-11 13:57:54,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:54,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:55,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:55,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151144507] [2024-10-11 13:57:55,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151144507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:55,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:55,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 13:57:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113026935] [2024-10-11 13:57:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:55,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 13:57:55,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:55,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 13:57:55,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:57:55,698 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:56,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:56,336 INFO L93 Difference]: Finished difference Result 403 states and 593 transitions. [2024-10-11 13:57:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:57:56,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2024-10-11 13:57:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:56,337 INFO L225 Difference]: With dead ends: 403 [2024-10-11 13:57:56,337 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 13:57:56,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:57:56,338 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 313 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:56,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 874 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:57:56,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 13:57:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 212. [2024-10-11 13:57:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 190 states have (on average 1.4421052631578948) internal successors, (274), 190 states have internal predecessors, (274), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 314 transitions. [2024-10-11 13:57:56,352 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 314 transitions. Word has length 164 [2024-10-11 13:57:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:56,352 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 314 transitions. [2024-10-11 13:57:56,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:57:56,353 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 314 transitions. [2024-10-11 13:57:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 13:57:56,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:56,353 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:56,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 13:57:56,353 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:56,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:56,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2013837578, now seen corresponding path program 1 times [2024-10-11 13:57:56,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:56,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917636389] [2024-10-11 13:57:56,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:57:57,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:57,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917636389] [2024-10-11 13:57:57,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917636389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:57,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:57,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:57:57,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090083350] [2024-10-11 13:57:57,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:57,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:57:57,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:57,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:57:57,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:57:57,528 INFO L87 Difference]: Start difference. First operand 212 states and 314 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:58,141 INFO L93 Difference]: Finished difference Result 449 states and 662 transitions. [2024-10-11 13:57:58,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:57:58,142 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2024-10-11 13:57:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:58,143 INFO L225 Difference]: With dead ends: 449 [2024-10-11 13:57:58,143 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 13:57:58,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:57:58,145 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 257 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:58,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 363 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:57:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 13:57:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 212. [2024-10-11 13:57:58,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 190 states have (on average 1.436842105263158) internal successors, (273), 190 states have internal predecessors, (273), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:57:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 313 transitions. [2024-10-11 13:57:58,164 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 313 transitions. Word has length 164 [2024-10-11 13:57:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:57:58,164 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 313 transitions. [2024-10-11 13:57:58,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:57:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 313 transitions. [2024-10-11 13:57:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 13:57:58,168 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:57:58,169 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:57:58,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:57:58,169 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:57:58,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:57:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1069148854, now seen corresponding path program 1 times [2024-10-11 13:57:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:57:58,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194351086] [2024-10-11 13:57:58,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:57:58,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:57:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:57:58,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:57:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:57:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:57:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:57:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:57:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:57:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:57:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:57:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:57:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:57:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:57:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:57:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:57:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:57:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:57:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:57:58,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:57:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:57:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:57:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:57:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 13:57:58,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:57:58,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194351086] [2024-10-11 13:57:58,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194351086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:57:58,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:57:58,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 13:57:58,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709928647] [2024-10-11 13:57:58,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:57:58,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 13:57:58,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:57:58,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 13:57:58,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:57:58,912 INFO L87 Difference]: Start difference. First operand 212 states and 313 transitions. Second operand has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:57:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:57:59,986 INFO L93 Difference]: Finished difference Result 618 states and 892 transitions. [2024-10-11 13:57:59,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:57:59,987 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 164 [2024-10-11 13:57:59,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:57:59,989 INFO L225 Difference]: With dead ends: 618 [2024-10-11 13:57:59,989 INFO L226 Difference]: Without dead ends: 407 [2024-10-11 13:57:59,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2024-10-11 13:57:59,990 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 496 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:57:59,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 760 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:57:59,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-11 13:58:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 345. [2024-10-11 13:58:00,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 304 states have (on average 1.3980263157894737) internal successors, (425), 305 states have internal predecessors, (425), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 13:58:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 501 transitions. [2024-10-11 13:58:00,024 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 501 transitions. Word has length 164 [2024-10-11 13:58:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:00,024 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 501 transitions. [2024-10-11 13:58:00,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 3 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-10-11 13:58:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 501 transitions. [2024-10-11 13:58:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 13:58:00,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:00,025 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:58:00,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 13:58:00,025 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:00,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:00,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1886797304, now seen corresponding path program 1 times [2024-10-11 13:58:00,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:00,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369141144] [2024-10-11 13:58:00,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:00,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:58:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:58:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:58:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:58:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:58:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:58:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:58:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:58:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 13:58:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 13:58:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 13:58:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 13:58:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 13:58:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 13:58:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 13:58:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 13:58:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 13:58:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 13:58:00,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:00,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369141144] [2024-10-11 13:58:00,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369141144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:00,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:00,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:58:00,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324623938] [2024-10-11 13:58:00,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:00,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:58:00,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:00,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:58:00,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:00,084 INFO L87 Difference]: Start difference. First operand 345 states and 501 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:58:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:00,129 INFO L93 Difference]: Finished difference Result 698 states and 1019 transitions. [2024-10-11 13:58:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:58:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2024-10-11 13:58:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:00,132 INFO L225 Difference]: With dead ends: 698 [2024-10-11 13:58:00,132 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 13:58:00,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-10-11 13:58:00,133 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:00,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 327 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:00,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 13:58:00,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-11 13:58:00,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 313 states have (on average 1.3865814696485623) internal successors, (434), 314 states have internal predecessors, (434), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 13:58:00,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 510 transitions. [2024-10-11 13:58:00,164 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 510 transitions. Word has length 164 [2024-10-11 13:58:00,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:00,164 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 510 transitions. [2024-10-11 13:58:00,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-11 13:58:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 510 transitions. [2024-10-11 13:58:00,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-11 13:58:00,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:00,166 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:58:00,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 13:58:00,166 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:00,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:00,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1464095478, now seen corresponding path program 1 times [2024-10-11 13:58:00,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:00,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406742007] [2024-10-11 13:58:00,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:00,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:58:00,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165063743] [2024-10-11 13:58:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:00,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:58:00,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:58:00,267 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:58:00,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:58:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:58:00,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:58:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:58:01,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:58:01,457 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:58:01,457 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:58:01,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:58:01,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:58:01,662 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:01,787 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:58:01,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:58:01 BoogieIcfgContainer [2024-10-11 13:58:01,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:58:01,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:58:01,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:58:01,791 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:58:01,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:56:59" (3/4) ... [2024-10-11 13:58:01,793 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:58:01,794 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:58:01,794 INFO L158 Benchmark]: Toolchain (without parser) took 63145.28ms. Allocated memory was 180.4MB in the beginning and 897.6MB in the end (delta: 717.2MB). Free memory was 110.7MB in the beginning and 735.9MB in the end (delta: -625.1MB). Peak memory consumption was 92.4MB. Max. memory is 16.1GB. [2024-10-11 13:58:01,794 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:58:01,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.99ms. Allocated memory is still 180.4MB. Free memory was 110.5MB in the beginning and 92.4MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:58:01,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.52ms. Allocated memory is still 180.4MB. Free memory was 92.4MB in the beginning and 88.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:58:01,797 INFO L158 Benchmark]: Boogie Preprocessor took 67.69ms. Allocated memory is still 180.4MB. Free memory was 88.7MB in the beginning and 83.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:58:01,797 INFO L158 Benchmark]: RCFGBuilder took 652.25ms. Allocated memory is still 180.4MB. Free memory was 83.7MB in the beginning and 115.8MB in the end (delta: -32.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 13:58:01,797 INFO L158 Benchmark]: TraceAbstraction took 62095.82ms. Allocated memory was 180.4MB in the beginning and 897.6MB in the end (delta: 717.2MB). Free memory was 115.0MB in the beginning and 735.9MB in the end (delta: -620.8MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. [2024-10-11 13:58:01,797 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 897.6MB. Free memory is still 735.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:58:01,798 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.13ms. Allocated memory is still 121.6MB. Free memory is still 83.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.99ms. Allocated memory is still 180.4MB. Free memory was 110.5MB in the beginning and 92.4MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.52ms. Allocated memory is still 180.4MB. Free memory was 92.4MB in the beginning and 88.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.69ms. Allocated memory is still 180.4MB. Free memory was 88.7MB in the beginning and 83.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 652.25ms. Allocated memory is still 180.4MB. Free memory was 83.7MB in the beginning and 115.8MB in the end (delta: -32.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 62095.82ms. Allocated memory was 180.4MB in the beginning and 897.6MB in the end (delta: 717.2MB). Free memory was 115.0MB in the beginning and 735.9MB in the end (delta: -620.8MB). Peak memory consumption was 98.2MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 897.6MB. Free memory is still 735.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 137. Possible FailurePath: [L41] unsigned char isInitial = 0; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L42-L60] struct WrapperStruct00 WrapperStruct00 = { 0, 16, 64, 25, 1.2, 999.7, 1.4, 9.75, 1.75, 16, 1277342739, 1394088949, 0, 0, 0, 0, 0 }; [L61] unsigned long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L62] unsigned long int* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L63] unsigned long int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L64] unsigned long int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L65] float* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L66] float* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L67] float* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L68] float* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L69] float* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L70] unsigned long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L71] unsigned long int* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L72] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L73] unsigned long int* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L74] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L75] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L76] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L77] unsigned char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L101] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L102] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L104] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L105] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967294) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L107] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L108] EXPR WrapperStruct00.var_1_5 [L108] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_5 [L108] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L108] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L109] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L110] EXPR WrapperStruct00.var_1_6 [L110] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_6 [L110] EXPR WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L110] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L110] EXPR (WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_6 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_6 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L112] WrapperStruct00.var_1_7 = __VERIFIER_nondet_float() [L113] EXPR WrapperStruct00.var_1_7 [L113] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_7 [L113] EXPR WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L113] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L114] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L115] EXPR WrapperStruct00.var_1_8 [L115] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L115] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_8 [L115] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L115] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L116] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_9 [L117] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_9 [L117] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L117] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L117] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L118] WrapperStruct00.var_1_11 = __VERIFIER_nondet_ulong() [L119] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L121] WrapperStruct00.var_1_12 = __VERIFIER_nondet_ulong() [L122] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L123] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L124] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L125] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L126] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L127] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L128] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L129] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L130] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L131] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L132] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, \old(cond)=1, isInitial=1] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L145] RET updateVariables() [L146] CALL step() [L81] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L81] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L81] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L81] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L81] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))) [L82] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L82] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L82] COND FALSE !(((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) [L85] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L85] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))) [L85] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L85] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L85] (*(WrapperStruct00_var_1_10_Pointer)) = (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))))) [L86] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L86] unsigned char stepLocal_0 = (- (*(WrapperStruct00_var_1_5_Pointer))) != 1.9f; [L87] stepLocal_0 || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L87] stepLocal_0 || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer))) [L87] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L87] stepLocal_0 || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L87] COND FALSE !(stepLocal_0 || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer)))) [L90] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L90] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L92] COND FALSE !((*(WrapperStruct00_var_1_18_Pointer))) [L146] RET step() [L147] CALL, EXPR property() [L137] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1) [L137] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1 [L137] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L137] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L137] EXPR (((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) ? ((! (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_18_Pointer)) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_17_Pointer))))) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR ((((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) ? ((! (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_18_Pointer)) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_17_Pointer))))) : 1) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) ? ((! (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_18_Pointer)) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_17_Pointer))))) : 1) : 1) : 1)) && ((((- (*(WrapperStruct00_var_1_5_Pointer))) != 1.9f) || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137] EXPR (((((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) ? ((! (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_18_Pointer)) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_17_Pointer))))) : 1) : 1) : 1)) && ((((- (*(WrapperStruct00_var_1_5_Pointer))) != 1.9f) || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L137-L138] return (((((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) && ((((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) <= ((*(WrapperStruct00_var_1_7_Pointer)) + ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) < ((*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned long int) (((((*(WrapperStruct00_var_1_2_Pointer))) > ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) ? ((*(WrapperStruct00_var_1_2_Pointer))) : ((((*(WrapperStruct00_var_1_11_Pointer)) + (*(WrapperStruct00_var_1_12_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))))))) && ((*(WrapperStruct00_var_1_18_Pointer)) ? ((! (((*(WrapperStruct00_var_1_5_Pointer)) / (*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))))) ? ((*(WrapperStruct00_var_1_18_Pointer)) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_17_Pointer))))) : 1) : 1) : 1)) && ((((- (*(WrapperStruct00_var_1_5_Pointer))) != 1.9f) || (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_13_Pointer))) < (*(WrapperStruct00_var_1_3_Pointer)))) ? ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_19_Pointer))))) : ((*(WrapperStruct00_var_1_18_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_19_Pointer))))) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:36}, WrapperStruct00_var_1_11_Pointer={4:40}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_13_Pointer={4:48}, WrapperStruct00_var_1_14_Pointer={4:52}, WrapperStruct00_var_1_17_Pointer={4:53}, WrapperStruct00_var_1_18_Pointer={4:54}, WrapperStruct00_var_1_19_Pointer={4:55}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:8}, WrapperStruct00_var_1_4_Pointer={4:12}, WrapperStruct00_var_1_5_Pointer={4:16}, WrapperStruct00_var_1_6_Pointer={4:20}, WrapperStruct00_var_1_7_Pointer={4:24}, WrapperStruct00_var_1_8_Pointer={4:28}, WrapperStruct00_var_1_9_Pointer={4:32}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.9s, OverallIterations: 21, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 34.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 5831 SdHoareTripleChecker+Valid, 23.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5830 mSDsluCounter, 13003 SdHoareTripleChecker+Invalid, 22.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10278 mSDsCounter, 329 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11828 IncrementalHoareTripleChecker+Invalid, 12158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 329 mSolverCounterUnsat, 2725 mSDtfsCounter, 11828 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1138 GetRequests, 869 SyntacticMatches, 7 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 14.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=354occurred in iteration=20, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 720 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 3566 NumberOfCodeBlocks, 3566 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3218 ConstructedInterpolants, 0 QuantifiedInterpolants, 52557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 15200/15200 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-10-11 13:58:01,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:58:03,618 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:58:03,676 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:58:03,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:58:03,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:58:03,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:58:03,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:58:03,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:58:03,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:58:03,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:58:03,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:58:03,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:58:03,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:58:03,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:58:03,716 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:58:03,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:58:03,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:58:03,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:58:03,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:58:03,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:58:03,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:58:03,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:58:03,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:58:03,720 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:58:03,720 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:58:03,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:58:03,721 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:58:03,721 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:58:03,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:58:03,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:58:03,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:58:03,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:58:03,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:58:03,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:58:03,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:58:03,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:58:03,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:58:03,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:58:03,722 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:58:03,723 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:58:03,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:58:03,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:58:03,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:58:03,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:58:03,724 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:58:03,724 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-clean/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-clean/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 -> 6ff28b25634280706396cfbea7901c68a9db0fe007a7f115a9dd84fe21326a05 [2024-10-11 13:58:03,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:58:03,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:58:03,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:58:03,979 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:58:03,983 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:58:03,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-10-11 13:58:05,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:58:05,371 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:58:05,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-23.i [2024-10-11 13:58:05,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dfcc405b7/31f7fc4a0d964b49842c8becd939efe3/FLAGcda2c20d2 [2024-10-11 13:58:05,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/dfcc405b7/31f7fc4a0d964b49842c8becd939efe3 [2024-10-11 13:58:05,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:58:05,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:58:05,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:58:05,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:58:05,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:58:05,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:58:05" (1/1) ... [2024-10-11 13:58:05,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2ca745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:05, skipping insertion in model container [2024-10-11 13:58:05,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:58:05" (1/1) ... [2024-10-11 13:58:05,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:58:05,931 WARN L248 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-23.i[917,930] [2024-10-11 13:58:05,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:58:06,017 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:58:06,029 WARN L248 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-23.i[917,930] [2024-10-11 13:58:06,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:58:06,111 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:58:06,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06 WrapperNode [2024-10-11 13:58:06,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:58:06,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:58:06,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:58:06,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:58:06,118 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,169 INFO L138 Inliner]: procedures = 33, calls = 178, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 552 [2024-10-11 13:58:06,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:58:06,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:58:06,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:58:06,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:58:06,182 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,182 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,211 INFO L175 MemorySlicer]: Split 146 memory accesses to 2 slices as follows [2, 144]. 99 percent of accesses are in the largest equivalence class. The 19 initializations are split as follows [2, 17]. The 18 writes are split as follows [0, 18]. [2024-10-11 13:58:06,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,222 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,233 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:58:06,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:58:06,234 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:58:06,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:58:06,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (1/1) ... [2024-10-11 13:58:06,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:58:06,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:58:06,261 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:58:06,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:58:06,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:58:06,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:58:06,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:58:06,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:58:06,299 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:58:06,299 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:58:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:58:06,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:58:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:58:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:58:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:58:06,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:58:06,407 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:58:06,409 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:58:18,635 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-11 13:58:18,636 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:58:18,672 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:58:18,673 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:58:18,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:58:18 BoogieIcfgContainer [2024-10-11 13:58:18,674 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:58:18,676 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:58:18,676 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:58:18,678 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:58:18,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:58:05" (1/3) ... [2024-10-11 13:58:18,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c646b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:58:18, skipping insertion in model container [2024-10-11 13:58:18,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:06" (2/3) ... [2024-10-11 13:58:18,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61c646b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:58:18, skipping insertion in model container [2024-10-11 13:58:18,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:58:18" (3/3) ... [2024-10-11 13:58:18,682 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-23.i [2024-10-11 13:58:18,696 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:58:18,696 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:58:18,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:58:18,760 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;@151fd89b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:58:18,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:58:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:58:18,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:58:18,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:18,779 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:58:18,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:18,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1505185099, now seen corresponding path program 1 times [2024-10-11 13:58:18,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:58:18,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113473223] [2024-10-11 13:58:18,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:18,798 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-10-11 13:58:18,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:58:18,800 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 13:58:18,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:58:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:19,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:58:19,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:58:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2024-10-11 13:58:19,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:58:19,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:58:19,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113473223] [2024-10-11 13:58:19,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113473223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:19,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:19,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:58:19,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028709441] [2024-10-11 13:58:19,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:19,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:58:19,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:58:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:58:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:58:19,344 INFO L87 Difference]: Start difference. First operand has 117 states, 94 states have (on average 1.446808510638298) internal successors, (136), 95 states have internal predecessors, (136), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:58:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:19,407 INFO L93 Difference]: Finished difference Result 231 states and 370 transitions. [2024-10-11 13:58:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:58:19,410 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2024-10-11 13:58:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:19,419 INFO L225 Difference]: With dead ends: 231 [2024-10-11 13:58:19,419 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 13:58:19,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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-10-11 13:58:19,426 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 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-10-11 13:58:19,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 13:58:19,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 13:58:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-11 13:58:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2024-10-11 13:58:19,470 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 160 [2024-10-11 13:58:19,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:19,471 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2024-10-11 13:58:19,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 13:58:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2024-10-11 13:58:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 13:58:19,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:19,475 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 13:58:19,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 13:58:19,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 13:58:19,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:19,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:19,677 INFO L85 PathProgramCache]: Analyzing trace with hash -615857535, now seen corresponding path program 1 times [2024-10-11 13:58:19,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:58:19,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888663499] [2024-10-11 13:58:19,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:19,678 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-10-11 13:58:19,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:58:19,681 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 13:58:19,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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