./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-36.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-36.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 9e2d5d0417bcd19dd1bd5aa35ba5f9873fa877cfd261a114441164de37024a87 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:58:23,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:58:23,138 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:58:23,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:58:23,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:58:23,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:58:23,166 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:58:23,166 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:58:23,167 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:58:23,167 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:58:23,167 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:58:23,168 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:58:23,168 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:58:23,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:58:23,169 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:58:23,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:58:23,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:58:23,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:58:23,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:58:23,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:58:23,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:58:23,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:58:23,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:58:23,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:58:23,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:58:23,176 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:58:23,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:58:23,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:58:23,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:58:23,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:58:23,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:58:23,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:58:23,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:58:23,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:58:23,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:58:23,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:58:23,178 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:58:23,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:58:23,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:58:23,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:58:23,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:58:23,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:58:23,181 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 -> 9e2d5d0417bcd19dd1bd5aa35ba5f9873fa877cfd261a114441164de37024a87 [2024-10-11 13:58:23,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:58:23,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:58:23,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:58:23,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:58:23,385 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:58:23,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-11 13:58:24,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:58:24,733 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:58:24,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-11 13:58:24,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8eb57e44a/b81de31a776f4b7a997e5ab59f921b5a/FLAG9a10a0cb7 [2024-10-11 13:58:24,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8eb57e44a/b81de31a776f4b7a997e5ab59f921b5a [2024-10-11 13:58:24,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:58:24,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:58:24,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:58:24,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:58:24,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:58:24,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:58:24" (1/1) ... [2024-10-11 13:58:24,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74dddbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:24, skipping insertion in model container [2024-10-11 13:58:24,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:58:24" (1/1) ... [2024-10-11 13:58:24,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:58:24,904 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-36.i[917,930] [2024-10-11 13:58:24,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:58:24,961 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:58:24,970 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-36.i[917,930] [2024-10-11 13:58:25,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:58:25,021 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:58:25,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25 WrapperNode [2024-10-11 13:58:25,022 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:58:25,023 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:58:25,023 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:58:25,023 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:58:25,028 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:25" (1/1) ... [2024-10-11 13:58:25,037 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:25" (1/1) ... [2024-10-11 13:58:25,062 INFO L138 Inliner]: procedures = 29, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 562 [2024-10-11 13:58:25,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:58:25,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:58:25,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:58:25,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:58:25,074 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:25" (1/1) ... [2024-10-11 13:58:25,074 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:25" (1/1) ... [2024-10-11 13:58:25,078 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:25" (1/1) ... [2024-10-11 13:58:25,097 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 18 writes are split as follows [0, 18]. [2024-10-11 13:58:25,097 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:25" (1/1) ... [2024-10-11 13:58:25,097 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:25" (1/1) ... [2024-10-11 13:58:25,108 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:25" (1/1) ... [2024-10-11 13:58:25,115 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:25" (1/1) ... [2024-10-11 13:58:25,117 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:25" (1/1) ... [2024-10-11 13:58:25,119 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:25" (1/1) ... [2024-10-11 13:58:25,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:58:25,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:58:25,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:58:25,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:58:25,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (1/1) ... [2024-10-11 13:58:25,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:58:25,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:58:25,152 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:25,156 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:25,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:58:25,193 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:58:25,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:58:25,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:58:25,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:58:25,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:58:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:58:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:58:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:58:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:58:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:58:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:58:25,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:58:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:58:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:58:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:58:25,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:58:25,303 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:58:25,305 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:58:25,707 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2024-10-11 13:58:25,707 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:58:25,728 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:58:25,729 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:58:25,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:58:25 BoogieIcfgContainer [2024-10-11 13:58:25,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:58:25,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:58:25,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:58:25,733 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:58:25,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:58:24" (1/3) ... [2024-10-11 13:58:25,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ef3e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:58:25, skipping insertion in model container [2024-10-11 13:58:25,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:25" (2/3) ... [2024-10-11 13:58:25,734 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ef3e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:58:25, skipping insertion in model container [2024-10-11 13:58:25,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:58:25" (3/3) ... [2024-10-11 13:58:25,735 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-11 13:58:25,750 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:58:25,750 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:58:25,807 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:58:25,813 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;@1bc309b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:58:25,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:58:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 102 states have (on average 1.5196078431372548) internal successors, (155), 103 states have internal predecessors, (155), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:58:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:58:25,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:25,829 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:25,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:25,834 INFO L85 PathProgramCache]: Analyzing trace with hash -477692360, now seen corresponding path program 1 times [2024-10-11 13:58:25,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:25,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328382627] [2024-10-11 13:58:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:25,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:58:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 13:58:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:58:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328382627] [2024-10-11 13:58:26,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328382627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:26,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:26,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:58:26,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733367284] [2024-10-11 13:58:26,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:26,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:58:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:26,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:58:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:58:26,263 INFO L87 Difference]: Start difference. First operand has 116 states, 102 states have (on average 1.5196078431372548) internal successors, (155), 103 states have internal predecessors, (155), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:58:26,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:26,301 INFO L93 Difference]: Finished difference Result 229 states and 363 transitions. [2024-10-11 13:58:26,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:58:26,305 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-11 13:58:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:26,313 INFO L225 Difference]: With dead ends: 229 [2024-10-11 13:58:26,313 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 13:58:26,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:26,322 INFO L432 NwaCegarLoop]: 168 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, 168 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:26,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 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:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 13:58:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-11 13:58:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.4851485148514851) internal successors, (150), 101 states have internal predecessors, (150), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:58:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2024-10-11 13:58:26,358 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 104 [2024-10-11 13:58:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:26,358 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2024-10-11 13:58:26,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:58:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2024-10-11 13:58:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:58:26,360 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:26,361 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:58:26,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:26,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:26,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1357778366, now seen corresponding path program 1 times [2024-10-11 13:58:26,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:26,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852595764] [2024-10-11 13:58:26,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:26,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:58:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 13:58:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:58:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:26,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:26,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852595764] [2024-10-11 13:58:26,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852595764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:26,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:26,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:58:26,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506971445] [2024-10-11 13:58:26,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:26,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:58:26,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:26,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:58:26,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:26,579 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:58:26,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:26,623 INFO L93 Difference]: Finished difference Result 229 states and 346 transitions. [2024-10-11 13:58:26,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:58:26,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-11 13:58:26,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:26,625 INFO L225 Difference]: With dead ends: 229 [2024-10-11 13:58:26,625 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 13:58:26,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:26,627 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:26,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:26,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 13:58:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 13:58:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.4757281553398058) internal successors, (152), 103 states have internal predecessors, (152), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:58:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 174 transitions. [2024-10-11 13:58:26,641 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 174 transitions. Word has length 104 [2024-10-11 13:58:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:26,642 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 174 transitions. [2024-10-11 13:58:26,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:58:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 174 transitions. [2024-10-11 13:58:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 13:58:26,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:26,644 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:58:26,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:26,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1155954432, now seen corresponding path program 1 times [2024-10-11 13:58:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:26,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470879705] [2024-10-11 13:58:26,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:26,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:58:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 13:58:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:58:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:26,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:26,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470879705] [2024-10-11 13:58:26,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470879705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:26,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:26,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:58:26,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736027448] [2024-10-11 13:58:26,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:26,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:58:26,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:26,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:58:26,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:26,989 INFO L87 Difference]: Start difference. First operand 116 states and 174 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:27,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:27,210 INFO L93 Difference]: Finished difference Result 351 states and 528 transitions. [2024-10-11 13:58:27,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:58:27,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2024-10-11 13:58:27,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:27,214 INFO L225 Difference]: With dead ends: 351 [2024-10-11 13:58:27,214 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 13:58:27,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:58:27,215 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 184 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:27,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 397 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:58:27,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 13:58:27,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 205. [2024-10-11 13:58:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 180 states have (on average 1.4666666666666666) internal successors, (264), 180 states have internal predecessors, (264), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:58:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 308 transitions. [2024-10-11 13:58:27,236 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 308 transitions. Word has length 104 [2024-10-11 13:58:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:27,237 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 308 transitions. [2024-10-11 13:58:27,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 308 transitions. [2024-10-11 13:58:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:58:27,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:27,239 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:58:27,239 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:27,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1914366729, now seen corresponding path program 1 times [2024-10-11 13:58:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:27,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511113143] [2024-10-11 13:58:27,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:58:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 13:58:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:27,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:58:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,047 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:28,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:28,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511113143] [2024-10-11 13:58:28,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511113143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:28,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:28,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:58:28,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999610458] [2024-10-11 13:58:28,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:28,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:28,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:28,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:28,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:58:28,055 INFO L87 Difference]: Start difference. First operand 205 states and 308 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:28,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:28,401 INFO L93 Difference]: Finished difference Result 454 states and 683 transitions. [2024-10-11 13:58:28,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:28,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-11 13:58:28,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:28,403 INFO L225 Difference]: With dead ends: 454 [2024-10-11 13:58:28,403 INFO L226 Difference]: Without dead ends: 339 [2024-10-11 13:58:28,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:58:28,405 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 314 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:28,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 785 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:58:28,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-10-11 13:58:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 243. [2024-10-11 13:58:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 218 states have (on average 1.4862385321100917) internal successors, (324), 218 states have internal predecessors, (324), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:58:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 368 transitions. [2024-10-11 13:58:28,426 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 368 transitions. Word has length 105 [2024-10-11 13:58:28,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:28,426 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 368 transitions. [2024-10-11 13:58:28,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:28,427 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 368 transitions. [2024-10-11 13:58:28,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 13:58:28,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:28,428 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:58:28,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:28,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:28,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1971206721, now seen corresponding path program 1 times [2024-10-11 13:58:28,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:28,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700377910] [2024-10-11 13:58:28,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:28,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:58:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 13:58:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:58:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:28,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:28,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700377910] [2024-10-11 13:58:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700377910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:58:28,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41170804] [2024-10-11 13:58:28,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:58:28,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:28,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:58:28,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:28,507 INFO L87 Difference]: Start difference. First operand 243 states and 368 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:28,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:28,532 INFO L93 Difference]: Finished difference Result 405 states and 616 transitions. [2024-10-11 13:58:28,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:58:28,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-11 13:58:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:28,534 INFO L225 Difference]: With dead ends: 405 [2024-10-11 13:58:28,536 INFO L226 Difference]: Without dead ends: 245 [2024-10-11 13:58:28,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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:28,537 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 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:28,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 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:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-11 13:58:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2024-10-11 13:58:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 220 states have (on average 1.481818181818182) internal successors, (326), 220 states have internal predecessors, (326), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:58:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 370 transitions. [2024-10-11 13:58:28,557 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 370 transitions. Word has length 107 [2024-10-11 13:58:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:28,560 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 370 transitions. [2024-10-11 13:58:28,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:28,560 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 370 transitions. [2024-10-11 13:58:28,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 13:58:28,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:28,562 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:58:28,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:28,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:28,563 INFO L85 PathProgramCache]: Analyzing trace with hash -22937985, now seen corresponding path program 1 times [2024-10-11 13:58:28,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:28,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635366134] [2024-10-11 13:58:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:28,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:58:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 13:58:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:58:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:29,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:29,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635366134] [2024-10-11 13:58:29,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635366134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:29,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:29,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:58:29,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667052546] [2024-10-11 13:58:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:29,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:58:29,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:29,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:58:29,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:58:29,093 INFO L87 Difference]: Start difference. First operand 245 states and 370 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:29,298 INFO L93 Difference]: Finished difference Result 435 states and 655 transitions. [2024-10-11 13:58:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:29,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-11 13:58:29,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:29,301 INFO L225 Difference]: With dead ends: 435 [2024-10-11 13:58:29,301 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 13:58:29,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:58:29,302 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 236 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:29,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 539 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:58:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 13:58:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 217. [2024-10-11 13:58:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 192 states have (on average 1.4583333333333333) internal successors, (280), 192 states have internal predecessors, (280), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:58:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 324 transitions. [2024-10-11 13:58:29,322 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 324 transitions. Word has length 107 [2024-10-11 13:58:29,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:29,323 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 324 transitions. [2024-10-11 13:58:29,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:29,324 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 324 transitions. [2024-10-11 13:58:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 13:58:29,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:29,325 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:58:29,325 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:29,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:29,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1801592309, now seen corresponding path program 1 times [2024-10-11 13:58:29,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:29,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476189231] [2024-10-11 13:58:29,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:29,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:58:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 13:58:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:58:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:29,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,472 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:29,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:29,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476189231] [2024-10-11 13:58:29,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476189231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:29,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:29,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:58:29,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343477075] [2024-10-11 13:58:29,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:29,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:58:29,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:29,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:58:29,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:58:29,475 INFO L87 Difference]: Start difference. First operand 217 states and 324 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:29,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:29,513 INFO L93 Difference]: Finished difference Result 341 states and 509 transitions. [2024-10-11 13:58:29,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:58:29,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-10-11 13:58:29,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:29,515 INFO L225 Difference]: With dead ends: 341 [2024-10-11 13:58:29,515 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 13:58:29,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:58:29,517 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 649 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:58:29,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 649 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:29,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 13:58:29,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2024-10-11 13:58:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 195 states have (on average 1.4512820512820512) internal successors, (283), 195 states have internal predecessors, (283), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:58:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 327 transitions. [2024-10-11 13:58:29,531 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 327 transitions. Word has length 109 [2024-10-11 13:58:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:29,532 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 327 transitions. [2024-10-11 13:58:29,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 327 transitions. [2024-10-11 13:58:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 13:58:29,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:29,533 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:58:29,533 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:29,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1367347352, now seen corresponding path program 1 times [2024-10-11 13:58:29,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:29,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908809636] [2024-10-11 13:58:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:29,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:29,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:58:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 13:58:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:58:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:29,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:29,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908809636] [2024-10-11 13:58:29,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908809636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:29,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:29,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:58:29,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635998528] [2024-10-11 13:58:29,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:29,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:58:29,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:29,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:58:29,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:58:29,836 INFO L87 Difference]: Start difference. First operand 220 states and 327 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:30,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:30,035 INFO L93 Difference]: Finished difference Result 401 states and 594 transitions. [2024-10-11 13:58:30,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:58:30,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-10-11 13:58:30,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:30,037 INFO L225 Difference]: With dead ends: 401 [2024-10-11 13:58:30,037 INFO L226 Difference]: Without dead ends: 268 [2024-10-11 13:58:30,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:58:30,038 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 214 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:30,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 524 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:58:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-11 13:58:30,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 230. [2024-10-11 13:58:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 205 states have (on average 1.448780487804878) internal successors, (297), 205 states have internal predecessors, (297), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:58:30,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2024-10-11 13:58:30,049 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 109 [2024-10-11 13:58:30,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:30,050 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2024-10-11 13:58:30,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:30,050 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2024-10-11 13:58:30,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 13:58:30,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:30,051 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:58:30,051 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:30,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1061964343, now seen corresponding path program 1 times [2024-10-11 13:58:30,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:30,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361885948] [2024-10-11 13:58:30,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:30,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 13:58:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 13:58:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-11 13:58:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:58:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:58:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:58:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:58:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:58:30,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:58:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:58:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 13:58:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:30,355 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:30,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:58:30,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361885948] [2024-10-11 13:58:30,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361885948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:30,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:30,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:58:30,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632679560] [2024-10-11 13:58:30,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:30,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:58:30,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:58:30,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:58:30,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:58:30,357 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:30,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:30,597 INFO L93 Difference]: Finished difference Result 424 states and 622 transitions. [2024-10-11 13:58:30,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:58:30,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-10-11 13:58:30,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:30,599 INFO L225 Difference]: With dead ends: 424 [2024-10-11 13:58:30,599 INFO L226 Difference]: Without dead ends: 290 [2024-10-11 13:58:30,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:58:30,600 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 196 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:30,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 651 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:58:30,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-11 13:58:30,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 234. [2024-10-11 13:58:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 209 states have (on average 1.4401913875598087) internal successors, (301), 209 states have internal predecessors, (301), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 13:58:30,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 345 transitions. [2024-10-11 13:58:30,615 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 345 transitions. Word has length 109 [2024-10-11 13:58:30,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:30,616 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 345 transitions. [2024-10-11 13:58:30,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:30,616 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 345 transitions. [2024-10-11 13:58:30,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 13:58:30,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:30,617 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:58:30,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:30,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:30,618 INFO L85 PathProgramCache]: Analyzing trace with hash -360899765, now seen corresponding path program 1 times [2024-10-11 13:58:30,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:58:30,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694171227] [2024-10-11 13:58:30,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:30,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:58:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:58:30,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:58:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:58:30,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:58:30,746 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:58:30,747 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:58:30,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:58:30,750 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:58:30,832 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:58:30,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:58:30 BoogieIcfgContainer [2024-10-11 13:58:30,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:58:30,834 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:58:30,834 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:58:30,834 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:58:30,835 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:58:25" (3/4) ... [2024-10-11 13:58:30,836 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:58:30,837 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:58:30,837 INFO L158 Benchmark]: Toolchain (without parser) took 6082.47ms. Allocated memory was 165.7MB in the beginning and 295.7MB in the end (delta: 130.0MB). Free memory was 134.7MB in the beginning and 185.4MB in the end (delta: -50.7MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2024-10-11 13:58:30,837 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 121.6MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:58:30,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.90ms. Allocated memory is still 165.7MB. Free memory was 134.7MB in the beginning and 118.2MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 13:58:30,838 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.88ms. Allocated memory is still 165.7MB. Free memory was 118.2MB in the beginning and 114.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:58:30,838 INFO L158 Benchmark]: Boogie Preprocessor took 60.20ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 108.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 13:58:30,838 INFO L158 Benchmark]: RCFGBuilder took 605.14ms. Allocated memory is still 165.7MB. Free memory was 108.8MB in the beginning and 67.9MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-10-11 13:58:30,838 INFO L158 Benchmark]: TraceAbstraction took 5102.99ms. Allocated memory was 165.7MB in the beginning and 295.7MB in the end (delta: 130.0MB). Free memory was 66.9MB in the beginning and 185.4MB in the end (delta: -118.6MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-10-11 13:58:30,838 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 295.7MB. Free memory is still 185.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:58:30,839 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.12ms. Allocated memory is still 121.6MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.90ms. Allocated memory is still 165.7MB. Free memory was 134.7MB in the beginning and 118.2MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.88ms. Allocated memory is still 165.7MB. Free memory was 118.2MB in the beginning and 114.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.20ms. Allocated memory is still 165.7MB. Free memory was 114.1MB in the beginning and 108.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 605.14ms. Allocated memory is still 165.7MB. Free memory was 108.8MB in the beginning and 67.9MB in the end (delta: 40.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5102.99ms. Allocated memory was 165.7MB in the beginning and 295.7MB in the end (delta: 130.0MB). Free memory was 66.9MB in the beginning and 185.4MB in the end (delta: -118.6MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 295.7MB. Free memory is still 185.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of shiftRight at line 67. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L51] unsigned long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L53] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L54] float* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L55] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L56] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L57] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L58] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L59] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L60] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L61] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L62] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L63] unsigned char last_1_WrapperStruct00_var_1_14 = 1; [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L121] EXPR WrapperStruct00.var_1_14 [L121] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L100] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L104] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L105] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L106] EXPR WrapperStruct00.var_1_5 [L106] 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:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L106] EXPR WrapperStruct00.var_1_5 [L106] 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:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] 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:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] 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:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] 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:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] 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:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L107] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L110] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L111] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L111] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_12 [L113] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L113] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_12 [L113] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L113] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L113] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L114] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L115] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_13 [L115] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L115] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L115] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L116] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L118] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L132] RET updateVariables() [L133] CALL step() [L67] EXPR last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L67] COND FALSE !((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) [L70] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L70] COND FALSE !((*(WrapperStruct00_var_1_13_Pointer)) == (- (*(WrapperStruct00_var_1_12_Pointer)))) [L77] (*(WrapperStruct00_var_1_14_Pointer)) = 0 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L79] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L79] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L79] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer)) [L80] (*(WrapperStruct00_var_1_10_Pointer)) = 4.6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L84] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L84] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer)); [L85] stepLocal_0 && (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L85] stepLocal_0 && (*(WrapperStruct00_var_1_7_Pointer)) [L85] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L85] stepLocal_0 && (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L85] COND TRUE stepLocal_0 && (*(WrapperStruct00_var_1_7_Pointer)) [L86] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L86] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))) [L86] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L86] EXPR (((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L86] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L86] COND TRUE (((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer)) [L87] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L87] COND TRUE (*(WrapperStruct00_var_1_7_Pointer)) [L88] (*(WrapperStruct00_var_1_1_Pointer)) = 10u VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L124] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) [L124] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L124] EXPR (((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR ((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR ((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR (((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) 4.6)) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR (((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) 4.6)) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR ((((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) 4.6)) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) == (- (*(WrapperStruct00_var_1_12_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) && (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) 0))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124] EXPR ((((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) 4.6)) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) == (- (*(WrapperStruct00_var_1_12_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) && (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) 0))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L124-L125] return ((((((*(WrapperStruct00_var_1_10_Pointer)) > (*(WrapperStruct00_var_1_10_Pointer))) && (*(WrapperStruct00_var_1_7_Pointer))) ? (((((((*(WrapperStruct00_var_1_10_Pointer))) > ((- (*(WrapperStruct00_var_1_10_Pointer))))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((- (*(WrapperStruct00_var_1_10_Pointer)))))) != (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) 10u)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_9_Pointer))))) : 1)) && (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) 4.6)) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_11_Pointer))) > ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_11_Pointer))) : ((((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))))))) && (((*(WrapperStruct00_var_1_13_Pointer)) == (- (*(WrapperStruct00_var_1_12_Pointer)))) ? (((*(WrapperStruct00_var_1_7_Pointer)) && (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((unsigned char) 0))) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:15}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:31}, WrapperStruct00_var_1_13_Pointer={4:39}, WrapperStruct00_var_1_14_Pointer={4:47}, WrapperStruct00_var_1_16_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:4}, WrapperStruct00_var_1_4_Pointer={4:8}, WrapperStruct00_var_1_5_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:13}, WrapperStruct00_var_1_9_Pointer={4:14}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1144 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1144 mSDsluCounter, 4533 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3103 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1201 IncrementalHoareTripleChecker+Invalid, 1263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 1430 mSDtfsCounter, 1201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 266 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 304 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1067 NumberOfCodeBlocks, 1067 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 949 ConstructedInterpolants, 0 QuantifiedInterpolants, 3192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 1980/1980 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:30,866 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-36.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 9e2d5d0417bcd19dd1bd5aa35ba5f9873fa877cfd261a114441164de37024a87 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:58:32,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:58:32,680 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:32,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:58:32,687 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:58:32,711 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:58:32,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:58:32,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:58:32,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:58:32,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:58:32,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:58:32,713 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:58:32,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:58:32,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:58:32,716 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:58:32,716 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:58:32,716 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:58:32,717 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:58:32,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:58:32,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:58:32,720 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:58:32,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:58:32,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:58:32,720 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:58:32,720 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:58:32,721 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:58:32,721 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:58:32,721 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:58:32,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:58:32,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:58:32,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:58:32,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:58:32,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:58:32,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:58:32,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:58:32,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:58:32,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:58:32,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:58:32,723 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:58:32,723 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:58:32,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:58:32,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:58:32,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:58:32,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:58:32,726 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:58:32,726 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 -> 9e2d5d0417bcd19dd1bd5aa35ba5f9873fa877cfd261a114441164de37024a87 [2024-10-11 13:58:32,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:58:33,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:58:33,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:58:33,007 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:58:33,008 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:58:33,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-11 13:58:34,247 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:58:34,407 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:58:34,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-11 13:58:34,416 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5f78b91bf/fe6823f2bb544e9ca8e1b18ae416acbe/FLAG323dacdcd [2024-10-11 13:58:34,802 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5f78b91bf/fe6823f2bb544e9ca8e1b18ae416acbe [2024-10-11 13:58:34,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:58:34,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:58:34,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:58:34,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:58:34,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:58:34,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:58:34" (1/1) ... [2024-10-11 13:58:34,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65b305b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:34, skipping insertion in model container [2024-10-11 13:58:34,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:58:34" (1/1) ... [2024-10-11 13:58:34,839 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:58:34,976 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-36.i[917,930] [2024-10-11 13:58:35,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:58:35,070 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:58:35,081 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-36.i[917,930] [2024-10-11 13:58:35,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:58:35,139 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:58:35,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:35 WrapperNode [2024-10-11 13:58:35,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:58:35,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:58:35,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:58:35,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:58:35,147 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:35" (1/1) ... [2024-10-11 13:58:35,165 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:35" (1/1) ... [2024-10-11 13:58:35,202 INFO L138 Inliner]: procedures = 36, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 548 [2024-10-11 13:58:35,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:58:35,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:58:35,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:58:35,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:58:35,217 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:35" (1/1) ... [2024-10-11 13:58:35,217 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:35" (1/1) ... [2024-10-11 13:58:35,221 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:35" (1/1) ... [2024-10-11 13:58:35,241 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 18 writes are split as follows [0, 18]. [2024-10-11 13:58:35,241 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:35" (1/1) ... [2024-10-11 13:58:35,242 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:35" (1/1) ... [2024-10-11 13:58:35,252 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:35" (1/1) ... [2024-10-11 13:58:35,256 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:35" (1/1) ... [2024-10-11 13:58:35,261 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:35" (1/1) ... [2024-10-11 13:58:35,262 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:35" (1/1) ... [2024-10-11 13:58:35,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:58:35,271 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:58:35,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:58:35,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:58:35,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:35" (1/1) ... [2024-10-11 13:58:35,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:58:35,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:58:35,304 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:35,306 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:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:58:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 13:58:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 13:58:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 13:58:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 13:58:35,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 13:58:35,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:58:35,336 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:58:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:58:35,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:58:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 13:58:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 13:58:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 13:58:35,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 13:58:35,446 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:58:35,447 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:58:36,062 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2024-10-11 13:58:36,062 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:58:36,105 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:58:36,105 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:58:36,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:58:36 BoogieIcfgContainer [2024-10-11 13:58:36,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:58:36,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:58:36,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:58:36,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:58:36,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:58:34" (1/3) ... [2024-10-11 13:58:36,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a302c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:58:36, skipping insertion in model container [2024-10-11 13:58:36,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:58:35" (2/3) ... [2024-10-11 13:58:36,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a302c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:58:36, skipping insertion in model container [2024-10-11 13:58:36,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:58:36" (3/3) ... [2024-10-11 13:58:36,115 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-36.i [2024-10-11 13:58:36,127 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:58:36,127 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:58:36,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:58:36,186 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;@d619e52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:58:36,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:58:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:58:36,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:58:36,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:36,197 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:36,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:36,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1285315588, now seen corresponding path program 1 times [2024-10-11 13:58:36,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:58:36,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174440364] [2024-10-11 13:58:36,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:36,213 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:36,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:58:36,216 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:36,217 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:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:36,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:58:36,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:58:36,534 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 13:58:36,538 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:58:36,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:58:36,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174440364] [2024-10-11 13:58:36,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174440364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:36,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:36,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:58:36,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376756066] [2024-10-11 13:58:36,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:36,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:58:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:58:36,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:58:36,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:58:36,567 INFO L87 Difference]: Start difference. First operand has 112 states, 98 states have (on average 1.5204081632653061) internal successors, (149), 99 states have internal predecessors, (149), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:58:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:36,609 INFO L93 Difference]: Finished difference Result 217 states and 345 transitions. [2024-10-11 13:58:36,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:58:36,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-11 13:58:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:36,616 INFO L225 Difference]: With dead ends: 217 [2024-10-11 13:58:36,616 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 13:58:36,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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:36,621 INFO L432 NwaCegarLoop]: 154 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, 154 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:36,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 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:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 13:58:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-11 13:58:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 93 states have (on average 1.4623655913978495) internal successors, (136), 93 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:58:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2024-10-11 13:58:36,656 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 103 [2024-10-11 13:58:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:36,657 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2024-10-11 13:58:36,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:58:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2024-10-11 13:58:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:58:36,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:36,659 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,667 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:36,859 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:36,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:36,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:36,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1980611650, now seen corresponding path program 1 times [2024-10-11 13:58:36,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:58:36,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162818252] [2024-10-11 13:58:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:36,861 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:36,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:58:36,864 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:36,865 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 [2024-10-11 13:58:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:58:37,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:58:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-10-11 13:58:37,119 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:58:37,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:58:37,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162818252] [2024-10-11 13:58:37,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162818252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:37,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:37,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:58:37,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222108816] [2024-10-11 13:58:37,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:37,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:58:37,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:58:37,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:58:37,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:37,122 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:58:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:37,189 INFO L93 Difference]: Finished difference Result 213 states and 318 transitions. [2024-10-11 13:58:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:58:37,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-11 13:58:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:37,191 INFO L225 Difference]: With dead ends: 213 [2024-10-11 13:58:37,191 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 13:58:37,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:58:37,193 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:37,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 13:58:37,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-11 13:58:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 95 states have (on average 1.4526315789473685) internal successors, (138), 95 states have internal predecessors, (138), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:58:37,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2024-10-11 13:58:37,203 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 103 [2024-10-11 13:58:37,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:37,204 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2024-10-11 13:58:37,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 13:58:37,204 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2024-10-11 13:58:37,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:58:37,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:37,205 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,214 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-11 13:58:37,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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:37,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:37,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:37,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1753655868, now seen corresponding path program 1 times [2024-10-11 13:58:37,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:58:37,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627080789] [2024-10-11 13:58:37,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:37,407 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:37,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:58:37,410 INFO L229 MonitoredProcess]: Starting monitored process 4 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:37,411 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 (4)] Waiting until timeout for monitored process [2024-10-11 13:58:37,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:37,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 13:58:37,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:58:37,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:58:37,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 64 [2024-10-11 13:58:37,812 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:37,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:58:37,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:58:37,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627080789] [2024-10-11 13:58:37,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627080789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:37,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:37,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:58:37,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715313855] [2024-10-11 13:58:37,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:37,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:58:37,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:58:37,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:58:37,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:37,818 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:37,855 INFO L93 Difference]: Finished difference Result 211 states and 312 transitions. [2024-10-11 13:58:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:58:37,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-11 13:58:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:37,858 INFO L225 Difference]: With dead ends: 211 [2024-10-11 13:58:37,858 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 13:58:37,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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:37,860 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:37,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 284 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:37,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 13:58:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 13:58:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:58:37,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2024-10-11 13:58:37,875 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 103 [2024-10-11 13:58:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:37,876 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2024-10-11 13:58:37,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2024-10-11 13:58:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:58:37,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:37,878 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,890 INFO L540 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 (4)] Forceful destruction successful, exit code 0 [2024-10-11 13:58:38,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:38,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:38,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:38,080 INFO L85 PathProgramCache]: Analyzing trace with hash 742538618, now seen corresponding path program 1 times [2024-10-11 13:58:38,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:58:38,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1799905687] [2024-10-11 13:58:38,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:38,081 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:38,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:58:38,084 INFO L229 MonitoredProcess]: Starting monitored process 5 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:38,085 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 (5)] Waiting until timeout for monitored process [2024-10-11 13:58:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:58:38,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:58:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:38,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:58:38,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:58:38,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1799905687] [2024-10-11 13:58:38,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1799905687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:38,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:38,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:58:38,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216657846] [2024-10-11 13:58:38,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:38,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:58:38,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:58:38,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:58:38,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:58:38,344 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:58:38,366 INFO L93 Difference]: Finished difference Result 201 states and 292 transitions. [2024-10-11 13:58:38,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:58:38,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-11 13:58:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:58:38,367 INFO L225 Difference]: With dead ends: 201 [2024-10-11 13:58:38,367 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 13:58:38,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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:38,369 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:58:38,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 263 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:58:38,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 13:58:38,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 13:58:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.388235294117647) internal successors, (118), 85 states have internal predecessors, (118), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:58:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-10-11 13:58:38,376 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 103 [2024-10-11 13:58:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:58:38,379 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-10-11 13:58:38,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:38,379 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-10-11 13:58:38,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 13:58:38,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:58:38,381 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,389 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 (5)] Ended with exit code 0 [2024-10-11 13:58:38,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:38,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:58:38,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:58:38,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1443603196, now seen corresponding path program 1 times [2024-10-11 13:58:38,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:58:38,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744561359] [2024-10-11 13:58:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:58:38,583 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:38,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:58:38,585 INFO L229 MonitoredProcess]: Starting monitored process 6 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:38,587 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 (6)] Waiting until timeout for monitored process [2024-10-11 13:58:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:58:38,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 13:58:38,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:58:39,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:58:39,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2024-10-11 13:58:42,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2024-10-11 13:58:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:58:42,191 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:58:42,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:58:42,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744561359] [2024-10-11 13:58:42,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744561359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:58:42,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:58:42,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:58:42,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285707409] [2024-10-11 13:58:42,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:58:42,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:58:42,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:58:42,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:58:42,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=40, Unknown=1, NotChecked=0, Total=56 [2024-10-11 13:58:42,195 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:58:45,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:58:47,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:58:50,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:58:52,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:58:55,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:58:57,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:00,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:03,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:05,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:09,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:09,952 INFO L93 Difference]: Finished difference Result 234 states and 332 transitions. [2024-10-11 13:59:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:59:09,953 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 103 [2024-10-11 13:59:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:09,954 INFO L225 Difference]: With dead ends: 234 [2024-10-11 13:59:09,954 INFO L226 Difference]: Without dead ends: 137 [2024-10-11 13:59:09,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=45, Invalid=86, Unknown=1, NotChecked=0, Total=132 [2024-10-11 13:59:09,955 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 164 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:09,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 453 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 10 Unknown, 0 Unchecked, 27.6s Time] [2024-10-11 13:59:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-11 13:59:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 113. [2024-10-11 13:59:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 100 states have (on average 1.37) internal successors, (137), 100 states have internal predecessors, (137), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:59:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2024-10-11 13:59:09,965 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 103 [2024-10-11 13:59:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:09,966 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2024-10-11 13:59:09,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:59:09,966 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2024-10-11 13:59:09,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:59:09,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:09,967 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:09,978 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 (6)] Ended with exit code 0 [2024-10-11 13:59:10,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:59:10,172 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:10,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:10,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1866540490, now seen corresponding path program 1 times [2024-10-11 13:59:10,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:10,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307551389] [2024-10-11 13:59:10,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:10,173 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:59:10,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:10,174 INFO L229 MonitoredProcess]: Starting monitored process 7 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:59:10,175 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 (7)] Waiting until timeout for monitored process [2024-10-11 13:59:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:10,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 13:59:10,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:59:10,415 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:59:10,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:59:10,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307551389] [2024-10-11 13:59:10,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307551389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:10,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:10,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:59:10,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956748755] [2024-10-11 13:59:10,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:10,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:59:10,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:59:10,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:59:10,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:59:10,417 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:59:10,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:10,458 INFO L93 Difference]: Finished difference Result 227 states and 320 transitions. [2024-10-11 13:59:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:59:10,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-11 13:59:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:10,461 INFO L225 Difference]: With dead ends: 227 [2024-10-11 13:59:10,461 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 13:59:10,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 101 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:59:10,463 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:10,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:59:10,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 13:59:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 13:59:10,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 102 states have internal predecessors, (139), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:59:10,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2024-10-11 13:59:10,478 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 105 [2024-10-11 13:59:10,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:10,478 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2024-10-11 13:59:10,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:59:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2024-10-11 13:59:10,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 13:59:10,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:10,479 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:10,490 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 (7)] Ended with exit code 0 [2024-10-11 13:59:10,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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:59:10,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:10,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1008789156, now seen corresponding path program 1 times [2024-10-11 13:59:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:10,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975213446] [2024-10-11 13:59:10,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:10,682 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:59:10,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:10,683 INFO L229 MonitoredProcess]: Starting monitored process 8 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:59:10,683 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 (8)] Waiting until timeout for monitored process [2024-10-11 13:59:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:10,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:59:10,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:11,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-10-11 13:59:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:59:11,539 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:59:11,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:59:11,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975213446] [2024-10-11 13:59:11,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975213446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:11,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:11,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:59:11,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695074757] [2024-10-11 13:59:11,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:11,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:59:11,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:59:11,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:59:11,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:59:11,541 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:59:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:11,881 INFO L93 Difference]: Finished difference Result 227 states and 318 transitions. [2024-10-11 13:59:11,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:59:11,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-10-11 13:59:11,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:11,884 INFO L225 Difference]: With dead ends: 227 [2024-10-11 13:59:11,884 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 13:59:11,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:59:11,885 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 105 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:11,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 357 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:59:11,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 13:59:11,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2024-10-11 13:59:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 85 states have internal predecessors, (116), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:59:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 138 transitions. [2024-10-11 13:59:11,892 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 138 transitions. Word has length 105 [2024-10-11 13:59:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:11,893 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 138 transitions. [2024-10-11 13:59:11,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:59:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 138 transitions. [2024-10-11 13:59:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 13:59:11,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:11,894 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:11,903 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 (8)] Ended with exit code 0 [2024-10-11 13:59:12,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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:59:12,095 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:12,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:12,095 INFO L85 PathProgramCache]: Analyzing trace with hash -529087121, now seen corresponding path program 1 times [2024-10-11 13:59:12,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:12,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197955300] [2024-10-11 13:59:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:12,096 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:59:12,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:12,097 INFO L229 MonitoredProcess]: Starting monitored process 9 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:59:12,098 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 (9)] Waiting until timeout for monitored process [2024-10-11 13:59:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:12,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 13:59:12,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:13,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 13:59:13,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-10-11 13:59:13,254 INFO L349 Elim1Store]: treesize reduction 31, result has 26.2 percent of original size [2024-10-11 13:59:13,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 43 [2024-10-11 13:59:13,442 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:59:13,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 58 [2024-10-11 13:59:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:59:13,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:59:13,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:59:13,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197955300] [2024-10-11 13:59:13,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197955300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:13,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:13,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:59:13,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584764357] [2024-10-11 13:59:13,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:13,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:59:13,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:59:13,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:59:13,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:59:13,469 INFO L87 Difference]: Start difference. First operand 98 states and 138 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:59:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:14,375 INFO L93 Difference]: Finished difference Result 230 states and 319 transitions. [2024-10-11 13:59:14,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:59:14,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2024-10-11 13:59:14,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:14,376 INFO L225 Difference]: With dead ends: 230 [2024-10-11 13:59:14,376 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 13:59:14,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:59:14,377 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 187 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:14,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 444 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 13:59:14,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 13:59:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 114. [2024-10-11 13:59:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.316831683168317) internal successors, (133), 101 states have internal predecessors, (133), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:59:14,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2024-10-11 13:59:14,383 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 107 [2024-10-11 13:59:14,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:14,383 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2024-10-11 13:59:14,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:59:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2024-10-11 13:59:14,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 13:59:14,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:14,384 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:14,395 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 (9)] Ended with exit code 0 [2024-10-11 13:59:14,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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:59:14,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:14,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:14,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1972146531, now seen corresponding path program 1 times [2024-10-11 13:59:14,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:14,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024732760] [2024-10-11 13:59:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:14,586 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:59:14,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:14,587 INFO L229 MonitoredProcess]: Starting monitored process 10 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:59:14,588 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 (10)] Waiting until timeout for monitored process [2024-10-11 13:59:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:14,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 13:59:14,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:15,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-10-11 13:59:15,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-10-11 13:59:17,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:59:17,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2024-10-11 13:59:17,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:59:17,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 35 [2024-10-11 13:59:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 13:59:17,562 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:59:17,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:59:17,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024732760] [2024-10-11 13:59:17,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024732760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:59:17,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:59:17,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:59:17,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516366570] [2024-10-11 13:59:17,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:59:17,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:59:17,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:59:17,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:59:17,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=55, Unknown=1, NotChecked=0, Total=72 [2024-10-11 13:59:17,563 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:59:19,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:21,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:24,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:26,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:28,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:31,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:33,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:35,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:38,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:40,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 13:59:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:59:40,555 INFO L93 Difference]: Finished difference Result 174 states and 228 transitions. [2024-10-11 13:59:40,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:59:40,556 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2024-10-11 13:59:40,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:59:40,557 INFO L225 Difference]: With dead ends: 174 [2024-10-11 13:59:40,557 INFO L226 Difference]: Without dead ends: 172 [2024-10-11 13:59:40,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=55, Invalid=126, Unknown=1, NotChecked=0, Total=182 [2024-10-11 13:59:40,557 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 245 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 5 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.9s IncrementalHoareTripleChecker+Time [2024-10-11 13:59:40,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 537 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 421 Invalid, 10 Unknown, 0 Unchecked, 22.9s Time] [2024-10-11 13:59:40,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-10-11 13:59:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2024-10-11 13:59:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 149 states have (on average 1.2885906040268456) internal successors, (192), 149 states have internal predecessors, (192), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 13:59:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 214 transitions. [2024-10-11 13:59:40,563 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 214 transitions. Word has length 109 [2024-10-11 13:59:40,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:59:40,563 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 214 transitions. [2024-10-11 13:59:40,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-11 13:59:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 214 transitions. [2024-10-11 13:59:40,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 13:59:40,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:59:40,565 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:40,580 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 (10)] Ended with exit code 0 [2024-10-11 13:59:40,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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:59:40,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:59:40,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:59:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash 896964211, now seen corresponding path program 1 times [2024-10-11 13:59:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:59:40,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452774646] [2024-10-11 13:59:40,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:59:40,766 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:59:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:59:40,767 INFO L229 MonitoredProcess]: Starting monitored process 11 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:59:40,768 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 (11)] Waiting until timeout for monitored process [2024-10-11 13:59:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:59:41,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 13:59:41,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:59:41,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-11 13:59:42,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2024-10-11 13:59:42,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 40 [2024-10-11 13:59:45,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2024-10-11 13:59:51,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 65 [2024-10-11 13:59:52,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 65 [2024-10-11 13:59:57,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2024-10-11 13:59:57,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 114 [2024-10-11 13:59:58,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 129 [2024-10-11 13:59:58,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 13:59:58,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 191 treesize of output 87 [2024-10-11 13:59:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 44 proven. 144 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 13:59:58,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:00:00,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:00:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452774646] [2024-10-11 14:00:00,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452774646] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:00:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1961850734] [2024-10-11 14:00:00,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:00:00,517 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 14:00:00,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 14:00:00,518 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 14:00:00,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2024-10-11 14:00:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:00:02,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-11 14:00:02,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:00:03,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1