./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-7.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-7.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 c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:02:35,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:02:35,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:02:35,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:02:35,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:02:35,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:02:35,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:02:35,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:02:35,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:02:35,790 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:02:35,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:02:35,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:02:35,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:02:35,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:02:35,793 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:02:35,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:02:35,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:02:35,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:02:35,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:02:35,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:02:35,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:02:35,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:02:35,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:02:35,795 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:02:35,795 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:02:35,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:02:35,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:02:35,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:02:35,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:02:35,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:02:35,796 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:02:35,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:02:35,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:35,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:02:35,797 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:02:35,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:02:35,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:02:35,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:02:35,797 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:02:35,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:02:35,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:02:35,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:02:35,799 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 -> c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 [2024-10-11 14:02:35,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:02:35,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:02:35,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:02:35,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:02:35,991 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:02:35,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2024-10-11 14:02:37,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:02:37,325 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:02:37,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2024-10-11 14:02:37,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/60a09162e/c816167855274493bc41b1ece6fc21d9/FLAG6a18b0b05 [2024-10-11 14:02:37,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/60a09162e/c816167855274493bc41b1ece6fc21d9 [2024-10-11 14:02:37,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:02:37,738 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:02:37,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:37,739 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:02:37,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:02:37,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:37" (1/1) ... [2024-10-11 14:02:37,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e46ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:37, skipping insertion in model container [2024-10-11 14:02:37,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:37" (1/1) ... [2024-10-11 14:02:37,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:02:37,897 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-7.i[916,929] [2024-10-11 14:02:37,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:37,964 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:02:37,972 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-7.i[916,929] [2024-10-11 14:02:37,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:38,016 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:02:38,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38 WrapperNode [2024-10-11 14:02:38,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:38,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:38,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:02:38,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:02:38,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,061 INFO L138 Inliner]: procedures = 29, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 484 [2024-10-11 14:02:38,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:38,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:02:38,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:02:38,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:02:38,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,097 INFO L175 MemorySlicer]: Split 122 memory accesses to 2 slices as follows [2, 120]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 16 writes are split as follows [0, 16]. [2024-10-11 14:02:38,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:02:38,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:02:38,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:02:38,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:02:38,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (1/1) ... [2024-10-11 14:02:38,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:38,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:02:38,149 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 14:02:38,175 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 14:02:38,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:02:38,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 14:02:38,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 14:02:38,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 14:02:38,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 14:02:38,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 14:02:38,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 14:02:38,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 14:02:38,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 14:02:38,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 14:02:38,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 14:02:38,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:02:38,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:02:38,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:02:38,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 14:02:38,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:02:38,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:02:38,350 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:02:38,351 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:02:38,763 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-10-11 14:02:38,763 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:02:38,789 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:02:38,789 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:02:38,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:38 BoogieIcfgContainer [2024-10-11 14:02:38,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:02:38,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:02:38,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:02:38,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:02:38,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:02:37" (1/3) ... [2024-10-11 14:02:38,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389ca30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:02:38, skipping insertion in model container [2024-10-11 14:02:38,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:38" (2/3) ... [2024-10-11 14:02:38,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389ca30b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:02:38, skipping insertion in model container [2024-10-11 14:02:38,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:38" (3/3) ... [2024-10-11 14:02:38,796 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-7.i [2024-10-11 14:02:38,807 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:02:38,807 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:02:38,855 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:02:38,860 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;@11a95743, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:02:38,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:02:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 79 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:38,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 14:02:38,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:38,873 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:38,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:38,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:38,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1198767643, now seen corresponding path program 1 times [2024-10-11 14:02:38,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:38,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905819109] [2024-10-11 14:02:38,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:38,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:02:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:02:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,116 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:39,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:39,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905819109] [2024-10-11 14:02:39,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905819109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:39,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:39,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:02:39,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923971719] [2024-10-11 14:02:39,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:39,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:02:39,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:39,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:02:39,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:02:39,144 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 79 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:39,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:39,176 INFO L93 Difference]: Finished difference Result 183 states and 294 transitions. [2024-10-11 14:02:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:02:39,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-11 14:02:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:39,184 INFO L225 Difference]: With dead ends: 183 [2024-10-11 14:02:39,184 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 14:02:39,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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 14:02:39,189 INFO L432 NwaCegarLoop]: 129 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, 129 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 14:02:39,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 14:02:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 14:02:39,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-11 14:02:39,219 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 98 [2024-10-11 14:02:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:39,220 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-11 14:02:39,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-11 14:02:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 14:02:39,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:39,223 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:39,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:02:39,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:39,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:39,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1312194037, now seen corresponding path program 1 times [2024-10-11 14:02:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:39,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234995044] [2024-10-11 14:02:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:02:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:02:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:39,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:39,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234995044] [2024-10-11 14:02:39,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234995044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:39,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:39,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:02:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187796417] [2024-10-11 14:02:39,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:39,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:02:39,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:39,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:02:39,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:02:39,440 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:39,472 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-10-11 14:02:39,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:02:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-11 14:02:39,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:39,474 INFO L225 Difference]: With dead ends: 182 [2024-10-11 14:02:39,475 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 14:02:39,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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 14:02:39,477 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 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 14:02:39,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 14:02:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 14:02:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-11 14:02:39,490 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 98 [2024-10-11 14:02:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:39,491 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-11 14:02:39,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-11 14:02:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 14:02:39,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:39,493 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:39,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:02:39,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:39,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:39,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1899000051, now seen corresponding path program 1 times [2024-10-11 14:02:39,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:39,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255648515] [2024-10-11 14:02:39,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:39,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:02:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:02:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:41,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:41,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255648515] [2024-10-11 14:02:41,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255648515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:41,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:41,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:02:41,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846818772] [2024-10-11 14:02:41,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:41,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:02:41,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:41,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:02:41,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:02:41,458 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:02:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:41,866 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2024-10-11 14:02:41,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:02:41,868 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 98 [2024-10-11 14:02:41,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:41,870 INFO L225 Difference]: With dead ends: 186 [2024-10-11 14:02:41,871 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 14:02:41,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-11 14:02:41,874 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 222 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:41,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 297 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:02:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 14:02:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2024-10-11 14:02:41,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.4) internal successors, (112), 80 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2024-10-11 14:02:41,893 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 98 [2024-10-11 14:02:41,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:41,893 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2024-10-11 14:02:41,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.1) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:02:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2024-10-11 14:02:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 14:02:41,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:41,895 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:41,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:02:41,895 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:41,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1401421324, now seen corresponding path program 1 times [2024-10-11 14:02:41,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:41,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240570650] [2024-10-11 14:02:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-11 14:02:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 14:02:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 14:02:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 14:02:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 14:02:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 14:02:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 14:02:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 14:02:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 14:02:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 14:02:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 14:02:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 14:02:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:43,255 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:43,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:02:43,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240570650] [2024-10-11 14:02:43,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240570650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:43,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:43,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 14:02:43,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917760732] [2024-10-11 14:02:43,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:43,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:02:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:02:43,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:02:43,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:02:43,261 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:02:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:43,634 INFO L93 Difference]: Finished difference Result 188 states and 272 transitions. [2024-10-11 14:02:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 14:02:43,634 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2024-10-11 14:02:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:43,635 INFO L225 Difference]: With dead ends: 188 [2024-10-11 14:02:43,635 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 14:02:43,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-11 14:02:43,637 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 213 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:43,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 360 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 14:02:43,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 14:02:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-10-11 14:02:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 133 transitions. [2024-10-11 14:02:43,651 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 133 transitions. Word has length 100 [2024-10-11 14:02:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:43,667 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 133 transitions. [2024-10-11 14:02:43,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 14:02:43,667 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 133 transitions. [2024-10-11 14:02:43,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 14:02:43,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:43,670 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:43,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:02:43,671 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:43,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:43,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1210731769, now seen corresponding path program 1 times [2024-10-11 14:02:43,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:02:43,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838630449] [2024-10-11 14:02:43,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:02:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 14:02:43,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484099634] [2024-10-11 14:02:43,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:43,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:02:43,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:02:43,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:02:43,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:02:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:02:43,905 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:02:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:02:44,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:02:44,065 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:02:44,066 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 14:02:44,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 14:02:44,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:02:44,270 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 14:02:44,372 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 14:02:44,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:02:44 BoogieIcfgContainer [2024-10-11 14:02:44,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 14:02:44,376 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 14:02:44,376 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 14:02:44,376 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 14:02:44,377 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:38" (3/4) ... [2024-10-11 14:02:44,378 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 14:02:44,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 14:02:44,380 INFO L158 Benchmark]: Toolchain (without parser) took 6641.21ms. Allocated memory was 205.5MB in the beginning and 310.4MB in the end (delta: 104.9MB). Free memory was 137.3MB in the beginning and 207.6MB in the end (delta: -70.3MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2024-10-11 14:02:44,380 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:02:44,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.80ms. Allocated memory is still 205.5MB. Free memory was 137.0MB in the beginning and 120.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 14:02:44,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.04ms. Allocated memory is still 205.5MB. Free memory was 120.5MB in the beginning and 116.7MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 14:02:44,384 INFO L158 Benchmark]: Boogie Preprocessor took 55.08ms. Allocated memory is still 205.5MB. Free memory was 116.7MB in the beginning and 111.7MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 14:02:44,384 INFO L158 Benchmark]: RCFGBuilder took 672.09ms. Allocated memory is still 205.5MB. Free memory was 111.7MB in the beginning and 139.2MB in the end (delta: -27.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 14:02:44,384 INFO L158 Benchmark]: TraceAbstraction took 5584.46ms. Allocated memory was 205.5MB in the beginning and 310.4MB in the end (delta: 104.9MB). Free memory was 139.2MB in the beginning and 207.6MB in the end (delta: -68.4MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2024-10-11 14:02:44,384 INFO L158 Benchmark]: Witness Printer took 2.97ms. Allocated memory is still 310.4MB. Free memory is still 207.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 14:02:44,385 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.80ms. Allocated memory is still 205.5MB. Free memory was 137.0MB in the beginning and 120.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.04ms. Allocated memory is still 205.5MB. Free memory was 120.5MB in the beginning and 116.7MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.08ms. Allocated memory is still 205.5MB. Free memory was 116.7MB in the beginning and 111.7MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 672.09ms. Allocated memory is still 205.5MB. Free memory was 111.7MB in the beginning and 139.2MB in the end (delta: -27.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5584.46ms. Allocated memory was 205.5MB in the beginning and 310.4MB in the end (delta: 104.9MB). Free memory was 139.2MB in the beginning and 207.6MB in the end (delta: -68.4MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * Witness Printer took 2.97ms. Allocated memory is still 310.4MB. Free memory is still 207.6MB. 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 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L47] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L49] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L50] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L51] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L52] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L53] unsigned short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L54] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L55] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L56] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L57] double last_1_WrapperStruct00_var_1_7 = 0.2; [L58] unsigned long int last_1_WrapperStruct00_var_1_12 = 5; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L114] EXPR WrapperStruct00.var_1_7 [L114] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L115] EXPR WrapperStruct00.var_1_12 [L115] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L93] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_3 [L94] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_3 [L94] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] EXPR (WrapperStruct00.var_1_3 >= 0.0F && 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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] EXPR (WrapperStruct00.var_1_3 >= 0.0F && 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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && 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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && 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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L95] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_4 [L96] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_4 [L96] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L97] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L103] WrapperStruct00.var_1_9 = __VERIFIER_nondet_ushort() [L104] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L107] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L126] RET updateVariables() [L127] CALL step() [L62] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L62] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L62] COND FALSE !(! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) [L69] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L69] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L71] (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L71] (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) [L71] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L71] (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L71] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L78] (*(WrapperStruct00_var_1_7_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L80] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L89] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR (! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L118] EXPR (! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) [L118] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) [L118] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L118] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR (((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))))) && ((*(WrapperStruct00_var_1_8_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer)))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR (((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))))) && ((*(WrapperStruct00_var_1_8_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer)))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118-L119] return (((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))))) && ((*(WrapperStruct00_var_1_8_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer)))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.4s, OverallIterations: 5, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 437 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 435 mSDsluCounter, 1037 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 638 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 821 IncrementalHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 399 mSDtfsCounter, 821 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=3, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 596 NumberOfCodeBlocks, 596 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 3341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1056/1056 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 14:02:44,419 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-7.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 c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:02:46,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:02:46,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 14:02:46,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:02:46,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:02:46,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:02:46,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:02:46,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:02:46,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:02:46,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:02:46,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:02:46,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:02:46,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:02:46,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:02:46,236 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:02:46,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:02:46,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:02:46,237 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:02:46,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:02:46,237 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:02:46,237 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:02:46,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:02:46,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:02:46,238 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 14:02:46,238 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 14:02:46,239 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:02:46,239 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 14:02:46,239 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:02:46,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:02:46,239 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:02:46,239 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:02:46,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:02:46,239 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:02:46,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:02:46,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:46,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:02:46,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:02:46,240 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:02:46,240 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 14:02:46,240 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 14:02:46,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:02:46,242 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:02:46,242 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:02:46,242 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:02:46,242 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 14:02:46,243 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 -> c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 [2024-10-11 14:02:46,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:02:46,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:02:46,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:02:46,517 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:02:46,518 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:02:46,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2024-10-11 14:02:47,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:02:47,997 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:02:47,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2024-10-11 14:02:48,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/25bae78aa/32172ab4d2ec45bab6bf28365241c30f/FLAG547954180 [2024-10-11 14:02:48,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/25bae78aa/32172ab4d2ec45bab6bf28365241c30f [2024-10-11 14:02:48,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:02:48,016 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:02:48,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:48,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:02:48,020 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:02:48,021 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae6a68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48, skipping insertion in model container [2024-10-11 14:02:48,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:02:48,169 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-7.i[916,929] [2024-10-11 14:02:48,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:48,243 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:02:48,254 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-7.i[916,929] [2024-10-11 14:02:48,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:02:48,314 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:02:48,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48 WrapperNode [2024-10-11 14:02:48,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:02:48,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:48,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:02:48,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:02:48,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,382 INFO L138 Inliner]: procedures = 39, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 484 [2024-10-11 14:02:48,385 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:02:48,386 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:02:48,386 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:02:48,386 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:02:48,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,455 INFO L175 MemorySlicer]: Split 122 memory accesses to 2 slices as follows [2, 120]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 16 writes are split as follows [0, 16]. [2024-10-11 14:02:48,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:02:48,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:02:48,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:02:48,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:02:48,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (1/1) ... [2024-10-11 14:02:48,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:02:48,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:02:48,507 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 14:02:48,509 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 14:02:48,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:02:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-11 14:02:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-11 14:02:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-11 14:02:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-11 14:02:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-11 14:02:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-11 14:02:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-11 14:02:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-11 14:02:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 14:02:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 14:02:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 14:02:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 14:02:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 14:02:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 14:02:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-11 14:02:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-11 14:02:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 14:02:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 14:02:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-11 14:02:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-11 14:02:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 14:02:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 14:02:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-11 14:02:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-11 14:02:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 14:02:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 14:02:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:02:48,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:02:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-11 14:02:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-11 14:02:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-11 14:02:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-11 14:02:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 14:02:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 14:02:48,656 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:02:48,660 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:02:50,542 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-10-11 14:02:50,542 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:02:50,580 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:02:50,580 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 14:02:50,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:50 BoogieIcfgContainer [2024-10-11 14:02:50,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:02:50,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:02:50,582 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:02:50,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:02:50,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:02:48" (1/3) ... [2024-10-11 14:02:50,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4edb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:02:50, skipping insertion in model container [2024-10-11 14:02:50,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:02:48" (2/3) ... [2024-10-11 14:02:50,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c4edb7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:02:50, skipping insertion in model container [2024-10-11 14:02:50,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:02:50" (3/3) ... [2024-10-11 14:02:50,589 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-7.i [2024-10-11 14:02:50,600 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:02:50,600 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:02:50,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:02:50,651 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;@58b5cf0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:02:50,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 14:02:50,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 79 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 14:02:50,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:50,666 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:50,666 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:50,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:50,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1198767643, now seen corresponding path program 1 times [2024-10-11 14:02:50,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:02:50,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024522327] [2024-10-11 14:02:50,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:50,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 14:02:50,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:02:50,685 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 14:02:50,686 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 14:02:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:50,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 14:02:50,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:02:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-11 14:02:51,003 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:02:51,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:02:51,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024522327] [2024-10-11 14:02:51,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024522327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:51,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:51,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:02:51,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374100857] [2024-10-11 14:02:51,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:51,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 14:02:51,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:02:51,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 14:02:51,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 14:02:51,033 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 79 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:51,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:51,086 INFO L93 Difference]: Finished difference Result 183 states and 294 transitions. [2024-10-11 14:02:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 14:02:51,089 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-11 14:02:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:51,096 INFO L225 Difference]: With dead ends: 183 [2024-10-11 14:02:51,096 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 14:02:51,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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 14:02:51,103 INFO L432 NwaCegarLoop]: 129 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, 129 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 14:02:51,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:51,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 14:02:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-11 14:02:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-11 14:02:51,146 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 98 [2024-10-11 14:02:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:51,147 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-11 14:02:51,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-11 14:02:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 14:02:51,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:51,151 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:51,164 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 (2)] Forceful destruction successful, exit code 0 [2024-10-11 14:02:51,356 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 14:02:51,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:51,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1312194037, now seen corresponding path program 1 times [2024-10-11 14:02:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:02:51,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026462152] [2024-10-11 14:02:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:51,359 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 14:02:51,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:02:51,361 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 14:02:51,362 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 14:02:51,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:51,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 14:02:51,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:02:51,684 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:51,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:02:51,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:02:51,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026462152] [2024-10-11 14:02:51,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026462152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:51,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:51,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:02:51,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43631444] [2024-10-11 14:02:51,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:51,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:02:51,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:02:51,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:02:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:02:51,688 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:51,747 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2024-10-11 14:02:51,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:02:51,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-11 14:02:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:51,751 INFO L225 Difference]: With dead ends: 182 [2024-10-11 14:02:51,751 INFO L226 Difference]: Without dead ends: 92 [2024-10-11 14:02:51,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 96 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 14:02:51,754 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 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 14:02:51,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 14:02:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-11 14:02:51,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-10-11 14:02:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4102564102564104) internal successors, (110), 78 states have internal predecessors, (110), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2024-10-11 14:02:51,764 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 98 [2024-10-11 14:02:51,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:51,765 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2024-10-11 14:02:51,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2024-10-11 14:02:51,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 14:02:51,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:51,767 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:51,777 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 (3)] Ended with exit code 0 [2024-10-11 14:02:51,968 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 14:02:51,969 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:51,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:51,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1899000051, now seen corresponding path program 1 times [2024-10-11 14:02:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:02:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548561169] [2024-10-11 14:02:51,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:51,970 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 14:02:51,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:02:51,972 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 14:02:51,972 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 14:02:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:52,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 14:02:52,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:02:52,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-11 14:02:52,420 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 14:02:52,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:02:52,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:02:52,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548561169] [2024-10-11 14:02:52,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548561169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:52,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:52,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:02:52,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144523618] [2024-10-11 14:02:52,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:52,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:02:52,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:02:52,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:02:52,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:02:52,422 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:54,193 INFO L93 Difference]: Finished difference Result 184 states and 268 transitions. [2024-10-11 14:02:54,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:02:54,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 98 [2024-10-11 14:02:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:54,194 INFO L225 Difference]: With dead ends: 184 [2024-10-11 14:02:54,194 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 14:02:54,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:02:54,196 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 130 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:54,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 353 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 14:02:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 14:02:54,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-11 14:02:54,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:54,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 133 transitions. [2024-10-11 14:02:54,202 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 133 transitions. Word has length 98 [2024-10-11 14:02:54,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:54,202 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 133 transitions. [2024-10-11 14:02:54,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 14:02:54,202 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 133 transitions. [2024-10-11 14:02:54,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 14:02:54,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:54,204 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:54,214 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 (4)] Ended with exit code 0 [2024-10-11 14:02:54,404 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 14:02:54,405 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:54,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:54,405 INFO L85 PathProgramCache]: Analyzing trace with hash 503507911, now seen corresponding path program 1 times [2024-10-11 14:02:54,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:02:54,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74414643] [2024-10-11 14:02:54,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:54,406 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 14:02:54,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:02:54,409 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 14:02:54,410 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 14:02:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:54,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:02:54,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:02:54,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-10-11 14:02:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-11 14:02:54,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 14:02:54,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:02:54,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74414643] [2024-10-11 14:02:54,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74414643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:02:54,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:02:54,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 14:02:54,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770073972] [2024-10-11 14:02:54,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:02:54,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 14:02:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:02:54,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 14:02:54,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 14:02:54,756 INFO L87 Difference]: Start difference. First operand 92 states and 133 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:56,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:02:56,311 INFO L93 Difference]: Finished difference Result 184 states and 266 transitions. [2024-10-11 14:02:56,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:02:56,311 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-10-11 14:02:56,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:02:56,312 INFO L225 Difference]: With dead ends: 184 [2024-10-11 14:02:56,312 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 14:02:56,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 14:02:56,314 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 119 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 14:02:56,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 348 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 14:02:56,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 14:02:56,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2024-10-11 14:02:56,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 14:02:56,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2024-10-11 14:02:56,325 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 100 [2024-10-11 14:02:56,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:02:56,325 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2024-10-11 14:02:56,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 14:02:56,325 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2024-10-11 14:02:56,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 14:02:56,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:02:56,326 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:02:56,339 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 (5)] Forceful destruction successful, exit code 0 [2024-10-11 14:02:56,527 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 14:02:56,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:02:56,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:02:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash -99255219, now seen corresponding path program 1 times [2024-10-11 14:02:56,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:02:56,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341887102] [2024-10-11 14:02:56,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:02:56,529 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 14:02:56,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:02:56,531 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 14:02:56,532 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 14:02:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:02:57,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 14:02:57,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:02:57,739 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 14:02:58,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 14:02:58,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-10-11 14:02:59,384 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 37 treesize of output 42 [2024-10-11 14:02:59,868 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 55 treesize of output 45 [2024-10-11 14:03:00,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2024-10-11 14:03:00,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2024-10-11 14:03:00,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2024-10-11 14:03:00,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 14:03:00,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 46 [2024-10-11 14:03:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 192 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 14:03:00,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:03:02,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 14:03:02,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341887102] [2024-10-11 14:03:02,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341887102] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:03:02,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [226871104] [2024-10-11 14:03:02,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:03:02,254 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 14:03:02,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 14:03:02,255 INFO L229 MonitoredProcess]: Starting monitored process 7 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:03:02,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-11 14:03:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:03:03,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 14:03:03,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:03:04,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 14:03:04,558 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 14:03:04,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-10-11 14:03:05,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-10-11 14:03:05,955 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 33 treesize of output 39 [2024-10-11 14:03:08,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 61 [2024-10-11 14:03:08,863 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 62 treesize of output 80 [2024-10-11 14:03:11,528 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 77 treesize of output 86 [2024-10-11 14:03:13,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 54 [2024-10-11 14:03:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 152 proven. 44 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-11 14:03:13,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:03:14,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [226871104] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:03:14,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 14:03:14,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2024-10-11 14:03:14,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721780132] [2024-10-11 14:03:14,034 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 14:03:14,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 14:03:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 14:03:14,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 14:03:14,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=498, Unknown=3, NotChecked=0, Total=600 [2024-10-11 14:03:14,036 INFO L87 Difference]: Start difference. First operand 92 states and 132 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 19 states have internal predecessors, (107), 10 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2024-10-11 14:03:19,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:03:23,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:03:31,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:03:35,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:03:38,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:03:40,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:03:42,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:03:45,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:03:49,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:03:53,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:03:56,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:03:58,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:04:04,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:04:07,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:04:10,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:04:12,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 14:04:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 14:04:15,117 INFO L93 Difference]: Finished difference Result 204 states and 290 transitions. [2024-10-11 14:04:15,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:04:15,118 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 19 states have internal predecessors, (107), 10 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) Word has length 102 [2024-10-11 14:04:15,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 14:04:15,121 INFO L225 Difference]: With dead ends: 204 [2024-10-11 14:04:15,121 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 14:04:15,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=210, Invalid=654, Unknown=6, NotChecked=0, Total=870 [2024-10-11 14:04:15,122 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 653 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 161 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.4s IncrementalHoareTripleChecker+Time [2024-10-11 14:04:15,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 335 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 519 Invalid, 16 Unknown, 0 Unchecked, 52.4s Time] [2024-10-11 14:04:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 14:04:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-10-11 14:04:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 96 states have internal predecessors, (129), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 14:04:15,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2024-10-11 14:04:15,135 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 102 [2024-10-11 14:04:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 14:04:15,135 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2024-10-11 14:04:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 19 states have internal predecessors, (107), 10 states have call successors, (24), 10 states have call predecessors, (24), 10 states have return successors, (24), 10 states have call predecessors, (24), 10 states have call successors, (24) [2024-10-11 14:04:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2024-10-11 14:04:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 14:04:15,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 14:04:15,137 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:04:15,151 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 14:04:15,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-10-11 14:04:15,537 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,7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 14:04:15,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 14:04:15,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:04:15,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1576509236, now seen corresponding path program 1 times [2024-10-11 14:04:15,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 14:04:15,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258156041] [2024-10-11 14:04:15,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:04:15,539 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 14:04:15,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 14:04:15,540 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 14:04:15,541 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