./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:13:27,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:13:27,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:13:27,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:13:27,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:13:27,693 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:13:27,695 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:13:27,696 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:13:27,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:13:27,697 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:13:27,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:13:27,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:13:27,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:13:27,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:13:27,701 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:13:27,701 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:13:27,701 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:13:27,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:13:27,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:13:27,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:13:27,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:13:27,705 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:13:27,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:13:27,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:13:27,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:13:27,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:13:27,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:13:27,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:13:27,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:13:27,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:13:27,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:13:27,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:13:27,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:27,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:13:27,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:13:27,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:13:27,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:13:27,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:13:27,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:13:27,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:13:27,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:13:27,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:13:27,713 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 [2024-11-19 01:13:28,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:13:28,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:13:28,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:13:28,045 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:13:28,045 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:13:28,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-19 01:13:29,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:13:29,672 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:13:29,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-19 01:13:29,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc0382f3/17dff81b5d6349aaa331156782092e6e/FLAGf3de22d2f [2024-11-19 01:13:29,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bc0382f3/17dff81b5d6349aaa331156782092e6e [2024-11-19 01:13:29,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:13:29,698 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:13:29,699 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:29,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:13:29,703 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:13:29,703 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:29" (1/1) ... [2024-11-19 01:13:29,704 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27109976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:29, skipping insertion in model container [2024-11-19 01:13:29,704 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:29" (1/1) ... [2024-11-19 01:13:29,729 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:13:29,883 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2024-11-19 01:13:29,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:29,939 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:13:29,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2024-11-19 01:13:29,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:30,013 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:13:30,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30 WrapperNode [2024-11-19 01:13:30,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:30,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:30,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:13:30,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:13:30,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,094 INFO L138 Inliner]: procedures = 29, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 368 [2024-11-19 01:13:30,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:30,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:13:30,096 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:13:30,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:13:30,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,144 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-19 01:13:30,144 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,154 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,157 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,164 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:13:30,164 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:13:30,165 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:13:30,165 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:13:30,165 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (1/1) ... [2024-11-19 01:13:30,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:30,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:30,203 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:13:30,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:13:30,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:13:30,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 01:13:30,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 01:13:30,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-19 01:13:30,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-19 01:13:30,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-19 01:13:30,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-19 01:13:30,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 01:13:30,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 01:13:30,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-19 01:13:30,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-19 01:13:30,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:13:30,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:13:30,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 01:13:30,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 01:13:30,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:13:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:13:30,352 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:13:30,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:13:30,789 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2024-11-19 01:13:30,790 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:13:30,806 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:13:30,806 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:13:30,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:30 BoogieIcfgContainer [2024-11-19 01:13:30,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:13:30,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:13:30,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:13:30,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:13:30,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:13:29" (1/3) ... [2024-11-19 01:13:30,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9cff2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:30, skipping insertion in model container [2024-11-19 01:13:30,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:30" (2/3) ... [2024-11-19 01:13:30,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d9cff2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:30, skipping insertion in model container [2024-11-19 01:13:30,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:30" (3/3) ... [2024-11-19 01:13:30,817 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-19 01:13:30,834 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:13:30,834 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:13:30,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:13:30,897 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;@47a901d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:13:30,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:13:30,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:13:30,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:13:30,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:30,909 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:13:30,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:30,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1487137030, now seen corresponding path program 1 times [2024-11-19 01:13:30,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:30,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571218139] [2024-11-19 01:13:30,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-19 01:13:31,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:13:31,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571218139] [2024-11-19 01:13:31,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571218139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:13:31,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846685416] [2024-11-19 01:13:31,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:31,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:13:31,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:31,180 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:13:31,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:13:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:31,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:13:31,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-19 01:13:31,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:31,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846685416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:31,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:13:31,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:13:31,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107141738] [2024-11-19 01:13:31,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:31,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:13:31,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:13:31,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:13:31,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:13:31,433 INFO L87 Difference]: Start difference. First operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:13:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:31,468 INFO L93 Difference]: Finished difference Result 160 states and 245 transitions. [2024-11-19 01:13:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:13:31,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 01:13:31,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:31,479 INFO L225 Difference]: With dead ends: 160 [2024-11-19 01:13:31,480 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 01:13:31,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:13:31,489 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:31,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:13:31,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 01:13:31,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 01:13:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:13:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-11-19 01:13:31,527 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 78 [2024-11-19 01:13:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:31,528 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-19 01:13:31,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:13:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-11-19 01:13:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:13:31,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:31,532 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:13:31,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:13:31,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:13:31,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:31,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1976566482, now seen corresponding path program 1 times [2024-11-19 01:13:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590109639] [2024-11-19 01:13:31,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:31,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:13:32,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:13:32,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590109639] [2024-11-19 01:13:32,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590109639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:32,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:32,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:13:32,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852409021] [2024-11-19 01:13:32,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:32,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:13:32,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:13:32,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:13:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:13:32,012 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:13:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:32,057 INFO L93 Difference]: Finished difference Result 155 states and 216 transitions. [2024-11-19 01:13:32,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:13:32,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 01:13:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:32,061 INFO L225 Difference]: With dead ends: 155 [2024-11-19 01:13:32,061 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 01:13:32,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:13:32,063 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:32,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:13:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 01:13:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 01:13:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:13:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2024-11-19 01:13:32,074 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 78 [2024-11-19 01:13:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:32,076 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2024-11-19 01:13:32,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:13:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2024-11-19 01:13:32,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:13:32,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:32,078 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:13:32,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:13:32,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:32,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:32,079 INFO L85 PathProgramCache]: Analyzing trace with hash 14991824, now seen corresponding path program 1 times [2024-11-19 01:13:32,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:32,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440448084] [2024-11-19 01:13:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:32,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:13:32,209 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:13:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:13:32,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:13:32,340 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:13:32,342 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:13:32,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:13:32,347 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 01:13:32,463 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:13:32,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:13:32 BoogieIcfgContainer [2024-11-19 01:13:32,468 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:13:32,469 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:13:32,469 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:13:32,470 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:13:32,470 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:30" (3/4) ... [2024-11-19 01:13:32,473 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:13:32,474 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:13:32,474 INFO L158 Benchmark]: Toolchain (without parser) took 2776.12ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 122.4MB in the beginning and 100.5MB in the end (delta: 21.8MB). Peak memory consumption was 54.0MB. Max. memory is 16.1GB. [2024-11-19 01:13:32,475 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 157.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:13:32,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.23ms. Allocated memory is still 157.3MB. Free memory was 122.4MB in the beginning and 107.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 01:13:32,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.64ms. Allocated memory is still 157.3MB. Free memory was 107.1MB in the beginning and 103.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:13:32,478 INFO L158 Benchmark]: Boogie Preprocessor took 68.45ms. Allocated memory is still 157.3MB. Free memory was 103.5MB in the beginning and 100.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:13:32,479 INFO L158 Benchmark]: RCFGBuilder took 643.36ms. Allocated memory is still 157.3MB. Free memory was 100.1MB in the beginning and 107.1MB in the end (delta: -7.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 01:13:32,479 INFO L158 Benchmark]: TraceAbstraction took 1658.49ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 106.8MB in the beginning and 100.5MB in the end (delta: 6.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-19 01:13:32,479 INFO L158 Benchmark]: Witness Printer took 4.85ms. Allocated memory is still 190.8MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:13:32,481 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.20ms. Allocated memory is still 157.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.23ms. Allocated memory is still 157.3MB. Free memory was 122.4MB in the beginning and 107.1MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.64ms. Allocated memory is still 157.3MB. Free memory was 107.1MB in the beginning and 103.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.45ms. Allocated memory is still 157.3MB. Free memory was 103.5MB in the beginning and 100.1MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 643.36ms. Allocated memory is still 157.3MB. Free memory was 100.1MB in the beginning and 107.1MB in the end (delta: -7.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1658.49ms. Allocated memory was 157.3MB in the beginning and 190.8MB in the end (delta: 33.6MB). Free memory was 106.8MB in the beginning and 100.5MB in the end (delta: 6.3MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Witness Printer took 4.85ms. Allocated memory is still 190.8MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of someBinaryArithmeticDOUBLEoperation at line 71. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 25.8, 1, 128.2, 15.4, 5.25, 1, 100, 1, 5 }; [L45] double* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_2_Pointer = &(WrapperStruct0.var_1_2); [L47] double* WrapperStruct0_var_1_3_Pointer = &(WrapperStruct0.var_1_3); [L48] double* WrapperStruct0_var_1_4_Pointer = &(WrapperStruct0.var_1_4); [L49] double* WrapperStruct0_var_1_5_Pointer = &(WrapperStruct0.var_1_5); [L50] unsigned char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L51] unsigned char* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L52] unsigned char* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L53] unsigned short int* WrapperStruct0_var_1_13_Pointer = &(WrapperStruct0.var_1_13); [L54] double last_1_WrapperStruct0_var_1_5 = 5.25; [L55] unsigned char last_1_WrapperStruct0_var_1_10 = 100; [L56] unsigned short int last_1_WrapperStruct0_var_1_13 = 5; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=0, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L107] EXPR WrapperStruct0.var_1_5 [L107] last_1_WrapperStruct0_var_1_5 = WrapperStruct0.var_1_5 [L108] EXPR WrapperStruct0.var_1_10 [L108] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L109] EXPR WrapperStruct0.var_1_13 [L109] last_1_WrapperStruct0_var_1_13 = WrapperStruct0.var_1_13 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L92] WrapperStruct0.var_1_2 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] CALL assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L93] RET assume_abort_if_not(WrapperStruct0.var_1_2 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] EXPR WrapperStruct0.var_1_2 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] CALL assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L94] RET assume_abort_if_not(WrapperStruct0.var_1_2 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L95] WrapperStruct0.var_1_3 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct0.var_1_3 [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F [L96] EXPR WrapperStruct0.var_1_3 [L96] EXPR WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] EXPR (WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] CALL assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L96] RET assume_abort_if_not((WrapperStruct0.var_1_3 >= 0.0F && WrapperStruct0.var_1_3 <= -1.0e-20F) || (WrapperStruct0.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L97] WrapperStruct0.var_1_4 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct0.var_1_4 [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F [L98] EXPR WrapperStruct0.var_1_4 [L98] EXPR WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] EXPR (WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] CALL assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L98] RET assume_abort_if_not((WrapperStruct0.var_1_4 >= 0.0F && WrapperStruct0.var_1_4 <= -1.0e-20F) || (WrapperStruct0.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L99] WrapperStruct0.var_1_9 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L100] CALL assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L100] RET assume_abort_if_not(WrapperStruct0.var_1_9 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] CALL assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L101] RET assume_abort_if_not(WrapperStruct0.var_1_9 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L102] WrapperStruct0.var_1_12 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] CALL assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L103] RET assume_abort_if_not(WrapperStruct0.var_1_12 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] EXPR WrapperStruct0.var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] CALL assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L104] RET assume_abort_if_not(WrapperStruct0.var_1_12 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L120] RET updateVariables() [L121] CALL step() [L60] EXPR \read(*WrapperStruct0_var_1_9_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L60] COND FALSE !((*(WrapperStruct0_var_1_9_Pointer))) [L65] COND FALSE !((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L70] EXPR \read(*WrapperStruct0_var_1_2_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L70] COND TRUE ! (*(WrapperStruct0_var_1_2_Pointer)) [L71] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L71] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L71] (*(WrapperStruct0_var_1_1_Pointer)) = ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))) [L75] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L75] EXPR \read(*WrapperStruct0_var_1_1_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L75] COND FALSE !(((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) [L88] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L88] (*(WrapperStruct0_var_1_5_Pointer)) = (*(WrapperStruct0_var_1_3_Pointer)) [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR \read(*WrapperStruct0_var_1_2_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer))))))) [L112] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L112] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L112] EXPR \read(*WrapperStruct0_var_1_4_Pointer) [L112] EXPR (! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer))))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR (((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112] EXPR ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L112-L113] return ((((! (*(WrapperStruct0_var_1_2_Pointer))) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((*(WrapperStruct0_var_1_3_Pointer)) - (*(WrapperStruct0_var_1_4_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((double) ((((16.2) < ((*(WrapperStruct0_var_1_3_Pointer)))) ? (16.2) : ((*(WrapperStruct0_var_1_3_Pointer)))))))) && ((((*(WrapperStruct0_var_1_3_Pointer)) + ((*(WrapperStruct0_var_1_4_Pointer)) + (*(WrapperStruct0_var_1_1_Pointer)))) != (*(WrapperStruct0_var_1_1_Pointer))) ? ((*(WrapperStruct0_var_1_2_Pointer)) ? (((- (*(WrapperStruct0_var_1_13_Pointer))) <= (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_9_Pointer)) ? ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_4_Pointer)))) : 1) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_5_Pointer)) == ((double) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((last_1_WrapperStruct0_var_1_13 + last_1_WrapperStruct0_var_1_13) < last_1_WrapperStruct0_var_1_13) ? ((last_1_WrapperStruct0_var_1_13 > last_1_WrapperStruct0_var_1_13) ? ((*(WrapperStruct0_var_1_10_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_12_Pointer)))) : 1) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) ? ((((*(WrapperStruct0_var_1_4_Pointer)) * ((*(WrapperStruct0_var_1_3_Pointer)) - 5.3)) <= last_1_WrapperStruct0_var_1_5) ? ((*(WrapperStruct0_var_1_13_Pointer)) == ((unsigned short int) last_1_WrapperStruct0_var_1_10)) : 1) : 1) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:34}, WrapperStruct0_var_1_12_Pointer={4:35}, WrapperStruct0_var_1_13_Pointer={4:36}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_2_Pointer={4:8}, WrapperStruct0_var_1_3_Pointer={4:9}, WrapperStruct0_var_1_4_Pointer={4:17}, WrapperStruct0_var_1_5_Pointer={4:25}, WrapperStruct0_var_1_9_Pointer={4:33}, isInitial=1, last_1_WrapperStruct0_var_1_10=100, last_1_WrapperStruct0_var_1_13=5, last_1_WrapperStruct0_var_1_5=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 201 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 214 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 302 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 322/336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 01:13:32,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:13:34,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:13:34,752 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:13:34,760 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:13:34,760 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:13:34,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:13:34,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:13:34,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:13:34,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:13:34,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:13:34,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:13:34,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:13:34,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:13:34,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:13:34,795 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:13:34,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:13:34,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:13:34,796 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:13:34,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:13:34,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:13:34,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:13:34,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:13:34,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:13:34,798 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:13:34,801 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:13:34,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:13:34,802 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:13:34,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:13:34,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:13:34,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:13:34,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:13:34,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:13:34,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:13:34,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:13:34,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:34,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:13:34,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:13:34,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:13:34,808 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:13:34,808 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:13:34,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:13:34,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:13:34,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:13:34,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:13:34,810 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f08343bb0cf522246be558fede7ff780229ba54086d45a049bb2b3d9e469da9 [2024-11-19 01:13:35,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:13:35,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:13:35,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:13:35,151 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:13:35,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:13:35,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-19 01:13:36,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:13:36,953 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:13:36,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-19 01:13:36,969 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df557da1/d4397573ea0543899d1c5379f0ec5c43/FLAG161387a01 [2024-11-19 01:13:36,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6df557da1/d4397573ea0543899d1c5379f0ec5c43 [2024-11-19 01:13:36,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:13:36,993 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:13:36,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:36,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:13:37,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:13:37,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:36" (1/1) ... [2024-11-19 01:13:37,004 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23e5be51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37, skipping insertion in model container [2024-11-19 01:13:37,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:36" (1/1) ... [2024-11-19 01:13:37,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:13:37,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2024-11-19 01:13:37,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:37,349 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:13:37,362 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-0.i[916,929] [2024-11-19 01:13:37,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:37,429 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:13:37,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37 WrapperNode [2024-11-19 01:13:37,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:37,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:37,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:13:37,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:13:37,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,504 INFO L138 Inliner]: procedures = 33, calls = 111, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 368 [2024-11-19 01:13:37,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:37,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:13:37,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:13:37,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:13:37,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,553 INFO L175 MemorySlicer]: Split 91 memory accesses to 2 slices as follows [2, 89]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2024-11-19 01:13:37,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,554 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,588 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,593 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:13:37,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:13:37,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:13:37,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:13:37,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (1/1) ... [2024-11-19 01:13:37,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:37,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:37,632 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:13:37,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:13:37,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:13:37,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:13:37,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:13:37,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:13:37,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:13:37,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:13:37,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:13:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 01:13:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 01:13:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:13:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:13:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-19 01:13:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-19 01:13:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:13:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:13:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:13:37,682 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:13:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:13:37,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:13:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:13:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:13:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:13:37,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:13:37,801 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:13:37,804 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:13:57,489 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-19 01:13:57,490 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:13:57,507 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:13:57,508 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:13:57,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:57 BoogieIcfgContainer [2024-11-19 01:13:57,508 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:13:57,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:13:57,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:13:57,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:13:57,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:13:36" (1/3) ... [2024-11-19 01:13:57,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d1a95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:57, skipping insertion in model container [2024-11-19 01:13:57,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:37" (2/3) ... [2024-11-19 01:13:57,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d1a95a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:57, skipping insertion in model container [2024-11-19 01:13:57,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:57" (3/3) ... [2024-11-19 01:13:57,519 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-0.i [2024-11-19 01:13:57,536 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:13:57,540 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:13:57,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:13:57,613 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;@4390d999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:13:57,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:13:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:13:57,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:13:57,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:57,631 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:13:57,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:57,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:57,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1487137030, now seen corresponding path program 1 times [2024-11-19 01:13:57,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:57,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7385417] [2024-11-19 01:13:57,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:57,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:13:57,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:57,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:13:57,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 01:13:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:58,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:13:58,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-19 01:13:58,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:58,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:13:58,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7385417] [2024-11-19 01:13:58,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7385417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:58,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:58,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:13:58,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185184641] [2024-11-19 01:13:58,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:58,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:13:58,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:13:58,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:13:58,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:13:58,333 INFO L87 Difference]: Start difference. First operand has 85 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 75 states have internal predecessors, (108), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:13:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:58,364 INFO L93 Difference]: Finished difference Result 160 states and 245 transitions. [2024-11-19 01:13:58,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:13:58,367 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 01:13:58,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:58,375 INFO L225 Difference]: With dead ends: 160 [2024-11-19 01:13:58,376 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 01:13:58,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:13:58,386 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:58,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:13:58,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 01:13:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 01:13:58,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 68 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:13:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2024-11-19 01:13:58,430 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 78 [2024-11-19 01:13:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:58,430 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2024-11-19 01:13:58,431 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:13:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2024-11-19 01:13:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:13:58,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:58,434 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:13:58,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 01:13:58,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:13:58,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:58,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:58,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1976566482, now seen corresponding path program 1 times [2024-11-19 01:13:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:58,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104651121] [2024-11-19 01:13:58,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:58,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:13:58,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:58,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:13:58,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 01:13:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:59,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:13:59,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 01:13:59,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:59,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:13:59,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104651121] [2024-11-19 01:13:59,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104651121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:59,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:59,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:13:59,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588544215] [2024-11-19 01:13:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:59,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:13:59,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:13:59,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:13:59,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:13:59,290 INFO L87 Difference]: Start difference. First operand 78 states and 108 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:13:59,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:59,420 INFO L93 Difference]: Finished difference Result 155 states and 216 transitions. [2024-11-19 01:13:59,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:13:59,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 01:13:59,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:59,422 INFO L225 Difference]: With dead ends: 155 [2024-11-19 01:13:59,422 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 01:13:59,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:13:59,424 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:59,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:13:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 01:13:59,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-19 01:13:59,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:13:59,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 110 transitions. [2024-11-19 01:13:59,435 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 110 transitions. Word has length 78 [2024-11-19 01:13:59,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:59,438 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 110 transitions. [2024-11-19 01:13:59,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:13:59,438 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 110 transitions. [2024-11-19 01:13:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 01:13:59,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:59,442 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:13:59,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:13:59,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:13:59,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:59,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash 14991824, now seen corresponding path program 1 times [2024-11-19 01:13:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321905356] [2024-11-19 01:13:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:59,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:13:59,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:59,648 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:13:59,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 01:14:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:14:00,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:14:00,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:14:00,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:14:00,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-19 01:14:00,641 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 01:14:00,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:14:00,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:14:00,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321905356] [2024-11-19 01:14:00,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321905356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:14:00,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:14:00,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:14:00,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760240868] [2024-11-19 01:14:00,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:14:00,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:14:00,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:14:00,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:14:00,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:14:00,647 INFO L87 Difference]: Start difference. First operand 80 states and 110 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:14:05,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:06,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:11,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:15,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:19,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:22,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:29,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:34,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:37,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:14:37,859 INFO L93 Difference]: Finished difference Result 157 states and 217 transitions. [2024-11-19 01:14:37,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:14:37,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 01:14:37,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:14:37,898 INFO L225 Difference]: With dead ends: 157 [2024-11-19 01:14:37,898 INFO L226 Difference]: Without dead ends: 80 [2024-11-19 01:14:37,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:14:37,900 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 94 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:14:37,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 284 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 5 Unknown, 0 Unchecked, 37.0s Time] [2024-11-19 01:14:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-19 01:14:37,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-11-19 01:14:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 68 states have (on average 1.338235294117647) internal successors, (91), 68 states have internal predecessors, (91), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 01:14:37,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2024-11-19 01:14:37,910 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 78 [2024-11-19 01:14:37,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:14:37,910 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2024-11-19 01:14:37,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 01:14:37,910 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2024-11-19 01:14:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-19 01:14:37,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:14:37,913 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:14:37,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 01:14:38,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:14:38,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:14:38,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:14:38,115 INFO L85 PathProgramCache]: Analyzing trace with hash 196972952, now seen corresponding path program 1 times [2024-11-19 01:14:38,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:14:38,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160924494] [2024-11-19 01:14:38,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:14:38,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:14:38,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:14:38,119 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:14:38,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 01:14:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:14:38,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:14:38,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:14:38,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:14:38,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 64 [2024-11-19 01:14:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-19 01:14:39,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:14:39,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:14:39,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2024-11-19 01:14:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-19 01:14:39,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:14:39,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160924494] [2024-11-19 01:14:39,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1160924494] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:14:39,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:14:39,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-19 01:14:39,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271541807] [2024-11-19 01:14:39,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:14:39,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:14:39,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:14:39,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:14:39,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:14:39,797 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 4 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-19 01:14:44,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:48,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:52,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:54,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:56,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:58,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:15:01,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:15:07,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []