./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-73.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 e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:55:20,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:55:20,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:55:20,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:55:20,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:55:20,674 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:55:20,675 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:55:20,675 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:55:20,676 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:55:20,676 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:55:20,677 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:55:20,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:55:20,678 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:55:20,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:55:20,680 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:55:20,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:55:20,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:55:20,683 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:55:20,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:55:20,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:55:20,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:55:20,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:55:20,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:55:20,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:55:20,685 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:55:20,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:55:20,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:55:20,686 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:55:20,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:55:20,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:55:20,686 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:55:20,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:55:20,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:55:20,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:55:20,687 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:55:20,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:55:20,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:55:20,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:55:20,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:55:20,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:55:20,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:55:20,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:55:20,689 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 -> e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 [2024-11-12 07:55:20,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:55:21,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:55:21,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:55:21,010 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:55:21,010 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:55:21,011 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-73.i [2024-11-12 07:55:22,543 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:55:22,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:55:22,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-12 07:55:22,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f11d0e4/a6bd1060933a4b349f8cdf5932f35a0b/FLAG888674b7d [2024-11-12 07:55:23,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84f11d0e4/a6bd1060933a4b349f8cdf5932f35a0b [2024-11-12 07:55:23,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:55:23,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:55:23,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:55:23,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:55:23,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:55:23,129 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@727b08ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23, skipping insertion in model container [2024-11-12 07:55:23,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,162 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:55:23,373 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-73.i[917,930] [2024-11-12 07:55:23,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:55:23,527 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:55:23,541 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-73.i[917,930] [2024-11-12 07:55:23,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:55:23,620 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:55:23,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23 WrapperNode [2024-11-12 07:55:23,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:55:23,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:55:23,623 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:55:23,623 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:55:23,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,686 INFO L138 Inliner]: procedures = 30, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2024-11-12 07:55:23,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:55:23,687 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:55:23,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:55:23,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:55:23,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,714 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:55:23,715 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:55:23,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:55:23,767 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:55:23,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:55:23,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (1/1) ... [2024-11-12 07:55:23,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:55:23,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:55:23,805 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-12 07:55:23,812 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-12 07:55:23,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:55:23,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:55:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:55:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:55:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:55:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:55:23,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:55:23,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:55:23,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:55:23,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:55:23,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:55:23,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:55:23,979 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:55:23,981 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:55:24,531 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-12 07:55:24,531 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:55:24,550 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:55:24,550 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:55:24,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:55:24 BoogieIcfgContainer [2024-11-12 07:55:24,551 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:55:24,553 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:55:24,554 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:55:24,557 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:55:24,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:55:23" (1/3) ... [2024-11-12 07:55:24,558 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21320ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:55:24, skipping insertion in model container [2024-11-12 07:55:24,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:23" (2/3) ... [2024-11-12 07:55:24,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21320ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:55:24, skipping insertion in model container [2024-11-12 07:55:24,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:55:24" (3/3) ... [2024-11-12 07:55:24,560 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-12 07:55:24,577 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:55:24,577 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:55:24,636 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:55:24,643 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;@10a9d97f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:55:24,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:55:24,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 07:55:24,660 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:24,661 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:24,662 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:24,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:24,667 INFO L85 PathProgramCache]: Analyzing trace with hash -282641606, now seen corresponding path program 1 times [2024-11-12 07:55:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:24,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391089897] [2024-11-12 07:55:24,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:24,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:55:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:55:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:55:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:55:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:55:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:55:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:55:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:55:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:55:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:55:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:55:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:55:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:55:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:55:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:55:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:55:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:55:25,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391089897] [2024-11-12 07:55:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391089897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:25,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:25,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:55:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872146750] [2024-11-12 07:55:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:25,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:55:25,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:55:25,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:55:25,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:55:25,293 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:55:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:25,328 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-12 07:55:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:55:25,331 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-12 07:55:25,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:25,338 INFO L225 Difference]: With dead ends: 213 [2024-11-12 07:55:25,338 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 07:55:25,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-12 07:55:25,345 INFO L435 NwaCegarLoop]: 155 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, 155 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-12 07:55:25,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:55:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 07:55:25,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-12 07:55:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-12 07:55:25,393 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-12 07:55:25,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:25,394 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-12 07:55:25,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:55:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-12 07:55:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 07:55:25,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:25,398 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:25,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:55:25,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:25,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:25,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1163314308, now seen corresponding path program 1 times [2024-11-12 07:55:25,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:25,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397699061] [2024-11-12 07:55:25,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:25,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:55:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:55:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:55:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:55:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:55:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:55:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:55:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:55:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:55:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:55:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:55:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:55:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:55:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:55:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:55:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:55:25,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:55:25,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397699061] [2024-11-12 07:55:25,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397699061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:25,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:25,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:55:25,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279420556] [2024-11-12 07:55:25,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:25,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:55:25,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:55:25,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:55:25,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:55:25,946 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:55:25,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:25,988 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-12 07:55:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:55:25,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-12 07:55:25,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:25,995 INFO L225 Difference]: With dead ends: 211 [2024-11-12 07:55:25,995 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 07:55:25,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-12 07:55:25,997 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-12 07:55:25,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:55:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 07:55:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-12 07:55:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-12 07:55:26,012 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-12 07:55:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:26,014 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-12 07:55:26,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:55:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-12 07:55:26,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:55:26,016 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:26,017 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:26,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:55:26,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:26,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1992987499, now seen corresponding path program 1 times [2024-11-12 07:55:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:26,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108381214] [2024-11-12 07:55:26,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:26,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:55:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:55:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:55:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:55:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:55:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:55:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:55:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:55:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:55:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:55:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:55:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:55:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:55:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:55:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:55:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:55:26,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:55:26,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108381214] [2024-11-12 07:55:26,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108381214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:26,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:26,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:55:26,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478620175] [2024-11-12 07:55:26,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:26,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:55:26,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:55:26,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:55:26,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:55:26,321 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:55:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:26,362 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-12 07:55:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:55:26,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-12 07:55:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:26,365 INFO L225 Difference]: With dead ends: 216 [2024-11-12 07:55:26,365 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 07:55:26,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 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-12 07:55:26,367 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:55:26,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:55:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 07:55:26,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-12 07:55:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-12 07:55:26,377 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 131 [2024-11-12 07:55:26,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:26,378 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-12 07:55:26,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:55:26,379 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-12 07:55:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:55:26,381 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:26,381 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:26,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:55:26,381 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:26,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:26,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1991140457, now seen corresponding path program 1 times [2024-11-12 07:55:26,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56642511] [2024-11-12 07:55:26,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:55:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:55:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:55:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:55:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:55:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:55:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:55:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:55:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:55:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:55:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:55:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:55:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:55:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:55:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:55:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:55:26,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:55:26,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56642511] [2024-11-12 07:55:26,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56642511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:26,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:26,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:55:26,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798708265] [2024-11-12 07:55:26,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:26,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:55:26,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:55:26,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:55:26,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:55:26,858 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:55:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:27,177 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2024-11-12 07:55:27,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:55:27,178 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-12 07:55:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:27,179 INFO L225 Difference]: With dead ends: 219 [2024-11-12 07:55:27,179 INFO L226 Difference]: Without dead ends: 112 [2024-11-12 07:55:27,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:55:27,185 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 07:55:27,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 493 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 07:55:27,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-12 07:55:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-12 07:55:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-12 07:55:27,202 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 131 [2024-11-12 07:55:27,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:27,202 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-12 07:55:27,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:55:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-12 07:55:27,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:55:27,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:27,204 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:27,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:55:27,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:27,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:27,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1568438631, now seen corresponding path program 1 times [2024-11-12 07:55:27,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:27,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432304267] [2024-11-12 07:55:27,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:27,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:55:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:55:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:55:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:55:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:55:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:55:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:55:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:55:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:55:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:55:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:55:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:55:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:55:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:55:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:55:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:29,907 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:55:29,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:55:29,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432304267] [2024-11-12 07:55:29,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432304267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:29,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:29,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:55:29,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525131703] [2024-11-12 07:55:29,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:29,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:55:29,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:55:29,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:55:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:55:29,913 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 07:55:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:30,896 INFO L93 Difference]: Finished difference Result 274 states and 394 transitions. [2024-11-12 07:55:30,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:55:30,897 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2024-11-12 07:55:30,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:30,900 INFO L225 Difference]: With dead ends: 274 [2024-11-12 07:55:30,901 INFO L226 Difference]: Without dead ends: 165 [2024-11-12 07:55:30,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:55:30,904 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 243 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:55:30,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 369 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 07:55:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-12 07:55:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2024-11-12 07:55:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:30,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2024-11-12 07:55:30,936 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 131 [2024-11-12 07:55:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:30,937 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2024-11-12 07:55:30,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 07:55:30,937 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2024-11-12 07:55:30,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:55:30,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:30,939 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:30,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 07:55:30,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:30,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash -557321381, now seen corresponding path program 1 times [2024-11-12 07:55:30,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:30,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874554585] [2024-11-12 07:55:30,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:30,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:55:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:55:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:55:33,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:55:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:55:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:55:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:55:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:55:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:55:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:55:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:55:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:55:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:55:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:55:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:55:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:33,571 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:55:33,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:55:33,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874554585] [2024-11-12 07:55:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874554585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:33,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:33,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:55:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533034206] [2024-11-12 07:55:33,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:33,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:55:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:55:33,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:55:33,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:55:33,573 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 07:55:34,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:34,480 INFO L93 Difference]: Finished difference Result 319 states and 467 transitions. [2024-11-12 07:55:34,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:55:34,480 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2024-11-12 07:55:34,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:34,482 INFO L225 Difference]: With dead ends: 319 [2024-11-12 07:55:34,483 INFO L226 Difference]: Without dead ends: 196 [2024-11-12 07:55:34,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-12 07:55:34,485 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 07:55:34,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 541 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 07:55:34,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-12 07:55:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2024-11-12 07:55:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 154 states have internal predecessors, (214), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:55:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 274 transitions. [2024-11-12 07:55:34,522 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 274 transitions. Word has length 131 [2024-11-12 07:55:34,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:34,522 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 274 transitions. [2024-11-12 07:55:34,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 07:55:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 274 transitions. [2024-11-12 07:55:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 07:55:34,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:34,526 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:34,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:55:34,526 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:34,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1833875789, now seen corresponding path program 1 times [2024-11-12 07:55:34,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:34,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620538080] [2024-11-12 07:55:34,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:34,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:55:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:55:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:55:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:55:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:55:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:55:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:55:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:55:36,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:55:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:55:36,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:55:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:55:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:55:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:55:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:55:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:55:36,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:55:36,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620538080] [2024-11-12 07:55:36,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620538080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:36,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:36,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 07:55:36,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613194181] [2024-11-12 07:55:36,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:36,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 07:55:36,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:55:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 07:55:36,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:55:36,557 INFO L87 Difference]: Start difference. First operand 187 states and 274 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 07:55:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:37,606 INFO L93 Difference]: Finished difference Result 354 states and 514 transitions. [2024-11-12 07:55:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:55:37,607 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2024-11-12 07:55:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:37,609 INFO L225 Difference]: With dead ends: 354 [2024-11-12 07:55:37,609 INFO L226 Difference]: Without dead ends: 231 [2024-11-12 07:55:37,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-12 07:55:37,611 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 242 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:55:37,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 364 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 07:55:37,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-12 07:55:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 190. [2024-11-12 07:55:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 157 states have (on average 1.3885350318471337) internal successors, (218), 157 states have internal predecessors, (218), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:55:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 278 transitions. [2024-11-12 07:55:37,639 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 278 transitions. Word has length 132 [2024-11-12 07:55:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:37,639 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 278 transitions. [2024-11-12 07:55:37,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 07:55:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 278 transitions. [2024-11-12 07:55:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 07:55:37,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:37,641 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:37,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 07:55:37,641 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:37,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:37,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1449974257, now seen corresponding path program 1 times [2024-11-12 07:55:37,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:37,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865510255] [2024-11-12 07:55:37,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:37,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:55:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:55:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:55:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:55:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:55:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:55:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:55:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:55:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:55:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:55:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:55:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:55:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:55:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:55:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:55:39,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:55:39,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:55:39,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865510255] [2024-11-12 07:55:39,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865510255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:39,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:39,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:55:39,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851310012] [2024-11-12 07:55:39,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:39,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:55:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:55:39,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:55:39,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:55:39,517 INFO L87 Difference]: Start difference. First operand 190 states and 278 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 07:55:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:40,048 INFO L93 Difference]: Finished difference Result 323 states and 472 transitions. [2024-11-12 07:55:40,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:55:40,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2024-11-12 07:55:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:40,050 INFO L225 Difference]: With dead ends: 323 [2024-11-12 07:55:40,050 INFO L226 Difference]: Without dead ends: 197 [2024-11-12 07:55:40,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:55:40,051 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 119 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 07:55:40,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 413 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 07:55:40,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-12 07:55:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2024-11-12 07:55:40,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 157 states have (on average 1.3821656050955413) internal successors, (217), 157 states have internal predecessors, (217), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:55:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 277 transitions. [2024-11-12 07:55:40,075 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 277 transitions. Word has length 132 [2024-11-12 07:55:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:40,076 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 277 transitions. [2024-11-12 07:55:40,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-12 07:55:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 277 transitions. [2024-11-12 07:55:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 07:55:40,078 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:40,079 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:40,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 07:55:40,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:40,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:40,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1231119539, now seen corresponding path program 1 times [2024-11-12 07:55:40,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:40,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934828558] [2024-11-12 07:55:40,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:40,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:55:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:55:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-12 07:55:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 07:55:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 07:55:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 07:55:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 07:55:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:55:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:55:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:55:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 07:55:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 07:55:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 07:55:41,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 07:55:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 07:55:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:41,931 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:55:41,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:55:41,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934828558] [2024-11-12 07:55:41,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934828558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:41,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:41,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 07:55:41,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183622538] [2024-11-12 07:55:41,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:41,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 07:55:41,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:55:41,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 07:55:41,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-12 07:55:41,936 INFO L87 Difference]: Start difference. First operand 190 states and 277 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:55:42,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:42,622 INFO L93 Difference]: Finished difference Result 364 states and 526 transitions. [2024-11-12 07:55:42,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 07:55:42,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-11-12 07:55:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:42,625 INFO L225 Difference]: With dead ends: 364 [2024-11-12 07:55:42,625 INFO L226 Difference]: Without dead ends: 238 [2024-11-12 07:55:42,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 07:55:42,629 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 134 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 07:55:42,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 419 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 07:55:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-12 07:55:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 196. [2024-11-12 07:55:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 163 states have (on average 1.3742331288343559) internal successors, (224), 163 states have internal predecessors, (224), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-12 07:55:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 284 transitions. [2024-11-12 07:55:42,656 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 284 transitions. Word has length 132 [2024-11-12 07:55:42,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:42,656 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 284 transitions. [2024-11-12 07:55:42,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:55:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 284 transitions. [2024-11-12 07:55:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-12 07:55:42,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:42,658 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:42,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 07:55:42,658 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:42,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:42,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2042779403, now seen corresponding path program 1 times [2024-11-12 07:55:42,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:42,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907121732] [2024-11-12 07:55:42,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:42,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:55:42,808 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 07:55:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 07:55:42,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 07:55:42,988 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 07:55:42,989 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 07:55:42,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 07:55:42,996 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:55:43,133 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 07:55:43,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 07:55:43 BoogieIcfgContainer [2024-11-12 07:55:43,137 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 07:55:43,138 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 07:55:43,138 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 07:55:43,138 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 07:55:43,138 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:55:24" (3/4) ... [2024-11-12 07:55:43,141 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 07:55:43,142 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 07:55:43,142 INFO L158 Benchmark]: Toolchain (without parser) took 20022.08ms. Allocated memory was 159.4MB in the beginning and 662.7MB in the end (delta: 503.3MB). Free memory was 100.5MB in the beginning and 370.2MB in the end (delta: -269.8MB). Peak memory consumption was 233.8MB. Max. memory is 16.1GB. [2024-11-12 07:55:43,142 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:55:43,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 499.86ms. Allocated memory is still 159.4MB. Free memory was 100.5MB in the beginning and 126.0MB in the end (delta: -25.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-12 07:55:43,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.23ms. Allocated memory is still 159.4MB. Free memory was 126.0MB in the beginning and 122.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 07:55:43,143 INFO L158 Benchmark]: Boogie Preprocessor took 78.31ms. Allocated memory is still 159.4MB. Free memory was 122.6MB in the beginning and 118.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 07:55:43,143 INFO L158 Benchmark]: RCFGBuilder took 784.33ms. Allocated memory is still 159.4MB. Free memory was 118.9MB in the beginning and 81.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-12 07:55:43,143 INFO L158 Benchmark]: TraceAbstraction took 18583.73ms. Allocated memory was 159.4MB in the beginning and 662.7MB in the end (delta: 503.3MB). Free memory was 80.6MB in the beginning and 370.2MB in the end (delta: -289.6MB). Peak memory consumption was 216.9MB. Max. memory is 16.1GB. [2024-11-12 07:55:43,144 INFO L158 Benchmark]: Witness Printer took 4.01ms. Allocated memory is still 662.7MB. Free memory is still 370.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 07:55:43,145 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.18ms. Allocated memory is still 96.5MB. Free memory was 50.7MB in the beginning and 50.7MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 499.86ms. Allocated memory is still 159.4MB. Free memory was 100.5MB in the beginning and 126.0MB in the end (delta: -25.5MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.23ms. Allocated memory is still 159.4MB. Free memory was 126.0MB in the beginning and 122.6MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.31ms. Allocated memory is still 159.4MB. Free memory was 122.6MB in the beginning and 118.9MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 784.33ms. Allocated memory is still 159.4MB. Free memory was 118.9MB in the beginning and 81.1MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18583.73ms. Allocated memory was 159.4MB in the beginning and 662.7MB in the end (delta: 503.3MB). Free memory was 80.6MB in the beginning and 370.2MB in the end (delta: -289.6MB). Peak memory consumption was 216.9MB. Max. memory is 16.1GB. * Witness Printer took 4.01ms. Allocated memory is still 662.7MB. Free memory is still 370.2MB. 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 134, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someUnaryDOUBLEoperation at line 42. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L55] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L57] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L58] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L59] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L60] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L61] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L62] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L63] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L64] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L65] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L67] signed char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L68] signed long int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L69] float last_1_WrapperStruct00_var_1_12 = 15.75; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=0, last_1_WrapperStruct00_var_1_12=63/4] [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] CALL updateLastVariables() [L131] EXPR WrapperStruct00.var_1_12 [L131] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L141] RET updateLastVariables() [L142] CALL updateVariables() [L105] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L108] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L110] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L113] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L116] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_13 [L117] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_13 [L117] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L121] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L126] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L127] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L142] RET updateVariables() [L143] CALL step() [L73] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L73] COND FALSE !((*(WrapperStruct00_var_1_6_Pointer))) [L76] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L76] COND FALSE !(last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) [L80] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L80] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L81] COND FALSE !((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] signed long int stepLocal_0 = ((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))); [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4, stepLocal_0=50] [L95] COND TRUE (*(WrapperStruct00_var_1_8_Pointer)) <= stepLocal_0 [L96] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L96] COND TRUE ! (*(WrapperStruct00_var_1_6_Pointer)) [L97] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L97] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L102] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L102] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L143] RET step() [L144] CALL, EXPR property() [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 [L134] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L134] EXPR (! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134-L135] return ((((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.4s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 813 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 811 mSDsluCounter, 3650 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2572 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2690 IncrementalHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 1078 mSDtfsCounter, 2690 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 342 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=9, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 139 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 1310 NumberOfCodeBlocks, 1310 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1169 ConstructedInterpolants, 0 QuantifiedInterpolants, 9231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3780/3780 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-12 07:55:43,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-73.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 e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:55:45,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:55:45,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 07:55:45,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:55:45,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:55:45,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:55:45,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:55:45,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:55:45,634 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:55:45,635 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:55:45,636 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:55:45,637 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:55:45,637 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:55:45,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:55:45,641 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:55:45,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:55:45,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:55:45,642 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:55:45,642 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:55:45,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:55:45,642 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:55:45,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:55:45,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:55:45,644 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 07:55:45,644 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 07:55:45,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:55:45,644 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 07:55:45,644 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:55:45,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:55:45,645 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:55:45,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:55:45,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:55:45,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:55:45,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:55:45,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:55:45,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:55:45,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:55:45,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:55:45,651 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 07:55:45,651 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 07:55:45,651 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:55:45,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:55:45,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:55:45,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:55:45,653 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 -> e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 [2024-11-12 07:55:46,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:55:46,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:55:46,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:55:46,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:55:46,044 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:55:46,045 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-73.i [2024-11-12 07:55:47,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:55:47,853 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:55:47,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-12 07:55:47,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b07872e27/346e8fb3a7c94a438cbfca2cecf33780/FLAGbd8fd2d08 [2024-11-12 07:55:47,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b07872e27/346e8fb3a7c94a438cbfca2cecf33780 [2024-11-12 07:55:47,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:55:47,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:55:47,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:55:47,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:55:47,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:55:47,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:55:47" (1/1) ... [2024-11-12 07:55:47,902 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753f8ae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:47, skipping insertion in model container [2024-11-12 07:55:47,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:55:47" (1/1) ... [2024-11-12 07:55:47,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:55:48,123 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-73.i[917,930] [2024-11-12 07:55:48,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:55:48,229 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:55:48,242 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-73.i[917,930] [2024-11-12 07:55:48,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:55:48,304 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:55:48,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48 WrapperNode [2024-11-12 07:55:48,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:55:48,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:55:48,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:55:48,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:55:48,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,331 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,374 INFO L138 Inliner]: procedures = 37, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2024-11-12 07:55:48,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:55:48,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:55:48,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:55:48,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:55:48,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,402 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,445 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2024-11-12 07:55:48,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:55:48,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:55:48,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:55:48,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:55:48,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (1/1) ... [2024-11-12 07:55:48,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:55:48,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:55:48,549 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-12 07:55:48,554 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-12 07:55:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:55:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-12 07:55:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-12 07:55:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-12 07:55:48,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-12 07:55:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-12 07:55:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-12 07:55:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 07:55:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 07:55:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 07:55:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 07:55:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-12 07:55:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-12 07:55:48,613 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 07:55:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 07:55:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-12 07:55:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-12 07:55:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-12 07:55:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-12 07:55:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-12 07:55:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-12 07:55:48,614 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:55:48,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:55:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-12 07:55:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-12 07:55:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:55:48,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:55:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-12 07:55:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-12 07:55:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 07:55:48,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 07:55:48,765 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:55:48,767 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:55:52,499 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-12 07:55:52,499 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:55:52,518 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:55:52,519 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:55:52,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:55:52 BoogieIcfgContainer [2024-11-12 07:55:52,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:55:52,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:55:52,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:55:52,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:55:52,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:55:47" (1/3) ... [2024-11-12 07:55:52,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af8fab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:55:52, skipping insertion in model container [2024-11-12 07:55:52,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:55:48" (2/3) ... [2024-11-12 07:55:52,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af8fab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:55:52, skipping insertion in model container [2024-11-12 07:55:52,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:55:52" (3/3) ... [2024-11-12 07:55:52,529 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-12 07:55:52,545 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:55:52,545 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:55:52,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:55:52,619 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;@6911b5fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:55:52,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:55:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:52,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 07:55:52,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:52,635 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:52,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:52,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:52,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2041388229, now seen corresponding path program 1 times [2024-11-12 07:55:52,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:55:52,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698997737] [2024-11-12 07:55:52,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:52,658 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-12 07:55:52,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:55:52,661 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-12 07:55:52,663 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-12 07:55:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:53,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 07:55:53,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:55:53,174 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-12 07:55:53,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:55:53,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:55:53,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698997737] [2024-11-12 07:55:53,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698997737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:53,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:53,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:55:53,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351528501] [2024-11-12 07:55:53,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:53,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:55:53,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:55:53,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:55:53,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:55:53,215 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:55:53,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:53,259 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-12 07:55:53,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:55:53,261 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-12 07:55:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:53,272 INFO L225 Difference]: With dead ends: 213 [2024-11-12 07:55:53,272 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 07:55:53,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-12 07:55:53,282 INFO L435 NwaCegarLoop]: 155 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, 155 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-12 07:55:53,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:55:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 07:55:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-12 07:55:53,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-12 07:55:53,329 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-12 07:55:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:53,330 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-12 07:55:53,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:55:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-12 07:55:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 07:55:53,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:53,334 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:53,343 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-12 07:55:53,534 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-12 07:55:53,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:53,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:53,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1160715527, now seen corresponding path program 1 times [2024-11-12 07:55:53,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:55:53,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522239581] [2024-11-12 07:55:53,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:53,537 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-12 07:55:53,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:55:53,539 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-12 07:55:53,540 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-12 07:55:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:53,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:55:53,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:55:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-12 07:55:54,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:55:54,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:55:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522239581] [2024-11-12 07:55:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522239581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:54,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:54,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:55:54,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067783315] [2024-11-12 07:55:54,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:54,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:55:54,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:55:54,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:55:54,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:55:54,006 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:55:54,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:54,089 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-12 07:55:54,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:55:54,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-12 07:55:54,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:54,095 INFO L225 Difference]: With dead ends: 211 [2024-11-12 07:55:54,095 INFO L226 Difference]: Without dead ends: 108 [2024-11-12 07:55:54,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 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-12 07:55:54,097 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-12 07:55:54,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 07:55:54,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-12 07:55:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-12 07:55:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-12 07:55:54,114 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-12 07:55:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:54,115 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-12 07:55:54,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:55:54,116 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-12 07:55:54,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-12 07:55:54,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:54,119 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:54,129 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-12 07:55:54,319 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-12 07:55:54,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:54,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash 689359177, now seen corresponding path program 1 times [2024-11-12 07:55:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:55:54,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736513782] [2024-11-12 07:55:54,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:54,323 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-12 07:55:54,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:55:54,324 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-12 07:55:54,326 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-12 07:55:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:54,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 07:55:54,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:55:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:55:54,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:55:54,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:55:54,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736513782] [2024-11-12 07:55:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736513782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:54,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:54,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:55:54,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149546251] [2024-11-12 07:55:54,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:54,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:55:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:55:54,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:55:54,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:55:54,767 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:55:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:54,811 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2024-11-12 07:55:54,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:55:54,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-12 07:55:54,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:54,816 INFO L225 Difference]: With dead ends: 215 [2024-11-12 07:55:54,818 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 07:55:54,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 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-12 07:55:54,820 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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-12 07:55:54,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:55:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 07:55:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-12 07:55:54,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:54,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-12 07:55:54,838 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 129 [2024-11-12 07:55:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:54,840 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-12 07:55:54,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:55:54,840 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-12 07:55:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:55:54,842 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:54,842 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:54,857 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 (4)] Ended with exit code 0 [2024-11-12 07:55:55,042 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-12 07:55:55,043 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:55,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:55,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1547220764, now seen corresponding path program 1 times [2024-11-12 07:55:55,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:55:55,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049294957] [2024-11-12 07:55:55,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:55,045 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-12 07:55:55,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:55:55,048 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-12 07:55:55,049 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-12 07:55:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:55,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 07:55:55,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:55:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:55:55,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:55:55,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:55:55,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049294957] [2024-11-12 07:55:55,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049294957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:55,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:55,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:55:55,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212913261] [2024-11-12 07:55:55,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:55,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:55:55,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:55:55,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:55:55,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:55:55,442 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:55:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:55,498 INFO L93 Difference]: Finished difference Result 222 states and 322 transitions. [2024-11-12 07:55:55,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:55:55,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-12 07:55:55,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:55,500 INFO L225 Difference]: With dead ends: 222 [2024-11-12 07:55:55,500 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 07:55:55,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:55:55,502 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:55:55,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:55:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 07:55:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-12 07:55:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-12 07:55:55,520 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 131 [2024-11-12 07:55:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:55,521 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-12 07:55:55,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:55:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-12 07:55:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-12 07:55:55,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:55,523 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:55,538 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 (5)] Forceful destruction successful, exit code 0 [2024-11-12 07:55:55,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:55:55,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:55,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:55,729 INFO L85 PathProgramCache]: Analyzing trace with hash 227786598, now seen corresponding path program 1 times [2024-11-12 07:55:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:55:55,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525658401] [2024-11-12 07:55:55,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:55,729 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-12 07:55:55,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:55:55,731 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:55:55,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 07:55:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:56,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:55:56,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:55:56,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-12 07:55:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-12 07:55:56,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:55:56,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:55:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525658401] [2024-11-12 07:55:56,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525658401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:56,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:56,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:55:56,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210988905] [2024-11-12 07:55:56,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:56,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:55:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:55:56,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:55:56,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:55:56,393 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:55:57,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:55:59,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:59,502 INFO L93 Difference]: Finished difference Result 226 states and 324 transitions. [2024-11-12 07:55:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:55:59,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-12 07:55:59,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:59,505 INFO L225 Difference]: With dead ends: 226 [2024-11-12 07:55:59,505 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 07:55:59,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:55:59,506 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-12 07:55:59,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 438 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-12 07:55:59,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 07:55:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-12 07:55:59,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:55:59,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-12 07:55:59,523 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 131 [2024-11-12 07:55:59,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:59,523 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-12 07:55:59,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:55:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-12 07:55:59,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-12 07:55:59,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:59,526 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:55:59,537 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 (6)] Forceful destruction successful, exit code 0 [2024-11-12 07:55:59,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 07:55:59,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:59,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:59,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1395501140, now seen corresponding path program 1 times [2024-11-12 07:55:59,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:55:59,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2151902] [2024-11-12 07:55:59,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:59,731 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-12 07:55:59,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:55:59,733 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 07:55:59,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 07:56:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:56:00,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 07:56:00,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:56:00,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-12 07:56:00,331 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-12 07:56:00,332 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:56:00,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:56:00,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2151902] [2024-11-12 07:56:00,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2151902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:56:00,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:56:00,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:56:00,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763388177] [2024-11-12 07:56:00,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:56:00,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 07:56:00,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:56:00,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 07:56:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 07:56:00,335 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:56:01,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:56:03,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:56:03,339 INFO L93 Difference]: Finished difference Result 226 states and 322 transitions. [2024-11-12 07:56:03,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 07:56:03,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-11-12 07:56:03,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:56:03,343 INFO L225 Difference]: With dead ends: 226 [2024-11-12 07:56:03,343 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 07:56:03,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-12 07:56:03,344 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 102 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-12 07:56:03,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 434 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-12 07:56:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 07:56:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-12 07:56:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:56:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2024-11-12 07:56:03,352 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 133 [2024-11-12 07:56:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:56:03,352 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2024-11-12 07:56:03,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 07:56:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2024-11-12 07:56:03,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:56:03,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:56:03,354 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:56:03,367 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 (7)] Ended with exit code 0 [2024-11-12 07:56:03,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-12 07:56:03,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:56:03,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:56:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash 752811686, now seen corresponding path program 1 times [2024-11-12 07:56:03,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:56:03,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095216804] [2024-11-12 07:56:03,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:56:03,557 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-12 07:56:03,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:56:03,558 INFO L229 MonitoredProcess]: Starting monitored process 8 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-12 07:56:03,559 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 (8)] Waiting until timeout for monitored process [2024-11-12 07:56:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:56:03,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 07:56:03,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:56:03,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-12 07:56:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:56:03,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:56:03,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:56:03,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095216804] [2024-11-12 07:56:03,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095216804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:56:03,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:56:03,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:56:03,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576867475] [2024-11-12 07:56:03,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:56:03,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:56:03,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:56:03,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:56:03,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:56:03,980 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:56:05,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 07:56:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:56:05,808 INFO L93 Difference]: Finished difference Result 227 states and 322 transitions. [2024-11-12 07:56:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:56:05,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-12 07:56:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:56:05,810 INFO L225 Difference]: With dead ends: 227 [2024-11-12 07:56:05,811 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 07:56:05,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 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-12 07:56:05,812 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 07:56:05,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 07:56:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 07:56:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-12 07:56:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:56:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2024-11-12 07:56:05,819 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 135 [2024-11-12 07:56:05,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:56:05,819 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2024-11-12 07:56:05,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:56:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2024-11-12 07:56:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-12 07:56:05,821 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:56:05,821 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:56:05,838 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 (8)] Forceful destruction successful, exit code 0 [2024-11-12 07:56:06,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-12 07:56:06,022 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:56:06,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:56:06,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1175513512, now seen corresponding path program 1 times [2024-11-12 07:56:06,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:56:06,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687904832] [2024-11-12 07:56:06,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:56:06,023 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-12 07:56:06,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:56:06,025 INFO L229 MonitoredProcess]: Starting monitored process 9 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-12 07:56:06,026 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 (9)] Waiting until timeout for monitored process [2024-11-12 07:56:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:56:06,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 07:56:06,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:56:06,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:56:06,511 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 46 treesize of output 34 [2024-11-12 07:56:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 07:56:06,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 07:56:06,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:56:06,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [687904832] [2024-11-12 07:56:06,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [687904832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:56:06,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:56:06,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 07:56:06,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352821329] [2024-11-12 07:56:06,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:56:06,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 07:56:06,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 07:56:06,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 07:56:06,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:56:06,564 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:56:07,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 07:56:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:56:10,535 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2024-11-12 07:56:10,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 07:56:10,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-12 07:56:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:56:10,537 INFO L225 Difference]: With dead ends: 229 [2024-11-12 07:56:10,537 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 07:56:10,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 07:56:10,538 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:56:10,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-12 07:56:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 07:56:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-12 07:56:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 97 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 07:56:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-12 07:56:10,545 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 135 [2024-11-12 07:56:10,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:56:10,549 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-12 07:56:10,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-12 07:56:10,549 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-12 07:56:10,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-12 07:56:10,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:56:10,551 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 07:56:10,569 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 (9)] Ended with exit code 0 [2024-11-12 07:56:10,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-12 07:56:10,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:56:10,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:56:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1295579430, now seen corresponding path program 1 times [2024-11-12 07:56:10,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 07:56:10,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130326371] [2024-11-12 07:56:10,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:56:10,755 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-12 07:56:10,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 07:56:10,757 INFO L229 MonitoredProcess]: Starting monitored process 10 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-12 07:56:10,758 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 (10)] Waiting until timeout for monitored process [2024-11-12 07:56:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:56:11,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-12 07:56:11,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:56:11,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:11,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:11,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:11,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:11,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:11,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:11,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:11,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:11,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:11,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:11,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 65 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 42 [2024-11-12 07:56:11,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-11-12 07:56:12,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2024-11-12 07:56:13,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-12 07:56:13,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-12 07:56:14,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-12 07:56:15,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-12 07:56:15,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-11-12 07:56:16,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-12 07:56:17,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-12 07:56:17,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2024-11-12 07:56:17,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2024-11-12 07:56:17,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 07:56:17,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 34 [2024-11-12 07:56:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 24 proven. 264 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-12 07:56:17,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:56:18,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 07:56:18,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130326371] [2024-11-12 07:56:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130326371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:56:18,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [790530019] [2024-11-12 07:56:18,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:56:18,311 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 07:56:18,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 07:56:18,312 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 07:56:18,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-12 07:56:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:56:19,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-12 07:56:19,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:56:19,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:19,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:56:20,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 76 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2024-11-12 07:56:20,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 79 [2024-11-12 07:56:21,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 87 [2024-11-12 07:56:24,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91 [2024-11-12 07:56:27,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91 [2024-11-12 07:56:31,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90 [2024-11-12 07:56:32,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90 [2024-11-12 07:56:32,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 83 [2024-11-12 07:56:36,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 79 [2024-11-12 07:56:36,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 72