./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.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 f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:19:04,537 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:19:04,609 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:19:04,615 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:19:04,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:19:04,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:19:04,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:19:04,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:19:04,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:19:04,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:19:04,658 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:19:04,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:19:04,659 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:19:04,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:19:04,659 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:19:04,659 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:19:04,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:19:04,660 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:19:04,660 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:19:04,660 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:19:04,660 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:19:04,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:19:04,666 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:19:04,666 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:19:04,667 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:19:04,667 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:19:04,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:19:04,667 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:19:04,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:19:04,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:19:04,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:19:04,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:19:04,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:19:04,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:19:04,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:19:04,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:19:04,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:19:04,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:19:04,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:19:04,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:19:04,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:19:04,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:19:04,672 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 -> f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da [2024-11-19 01:19:04,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:19:04,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:19:04,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:19:04,960 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:19:04,961 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:19:04,962 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-55.i [2024-11-19 01:19:06,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:19:06,647 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:19:06,648 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-11-19 01:19:06,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/775d90cab/c1dd89c9240c493cbeda5582e4195c13/FLAGb12242c37 [2024-11-19 01:19:06,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/775d90cab/c1dd89c9240c493cbeda5582e4195c13 [2024-11-19 01:19:06,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:19:06,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:19:06,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:19:06,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:19:06,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:19:06,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:19:06" (1/1) ... [2024-11-19 01:19:06,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58c8b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:06, skipping insertion in model container [2024-11-19 01:19:06,688 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:19:06" (1/1) ... [2024-11-19 01:19:06,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:19:06,895 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-55.i[917,930] [2024-11-19 01:19:06,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:19:06,966 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:19:06,976 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-55.i[917,930] [2024-11-19 01:19:07,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:19:07,051 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:19:07,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07 WrapperNode [2024-11-19 01:19:07,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:19:07,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:19:07,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:19:07,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:19:07,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,073 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,166 INFO L138 Inliner]: procedures = 30, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2024-11-19 01:19:07,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:19:07,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:19:07,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:19:07,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:19:07,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,194 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:19:07,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:19:07,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:19:07,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:19:07,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:19:07,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (1/1) ... [2024-11-19 01:19:07,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:19:07,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:19:07,277 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:19:07,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:19:07,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:19:07,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:19:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:19:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:19:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:19:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:19:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:19:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:19:07,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:19:07,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:19:07,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:19:07,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:19:07,459 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:19:07,461 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:19:08,058 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-19 01:19:08,058 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:19:08,074 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:19:08,074 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:19:08,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:19:08 BoogieIcfgContainer [2024-11-19 01:19:08,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:19:08,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:19:08,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:19:08,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:19:08,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:19:06" (1/3) ... [2024-11-19 01:19:08,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238afc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:19:08, skipping insertion in model container [2024-11-19 01:19:08,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:07" (2/3) ... [2024-11-19 01:19:08,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238afc93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:19:08, skipping insertion in model container [2024-11-19 01:19:08,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:19:08" (3/3) ... [2024-11-19 01:19:08,083 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-55.i [2024-11-19 01:19:08,101 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:19:08,101 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:19:08,162 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:19:08,167 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;@28bd7173, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:19:08,168 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:19:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:08,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 01:19:08,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:08,188 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:08,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:08,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:08,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1876789283, now seen corresponding path program 1 times [2024-11-19 01:19:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:08,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205739795] [2024-11-19 01:19:08,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:08,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:08,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:08,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205739795] [2024-11-19 01:19:08,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205739795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:08,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:08,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:19:08,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401879237] [2024-11-19 01:19:08,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:08,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:19:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:19:08,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:08,966 INFO L87 Difference]: Start difference. First operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:09,041 INFO L93 Difference]: Finished difference Result 218 states and 334 transitions. [2024-11-19 01:19:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:19:09,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-19 01:19:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:09,055 INFO L225 Difference]: With dead ends: 218 [2024-11-19 01:19:09,055 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 01:19:09,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:09,063 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:09,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:09,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 01:19:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-19 01:19:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-19 01:19:09,105 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 115 [2024-11-19 01:19:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:09,106 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-19 01:19:09,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-19 01:19:09,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 01:19:09,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:09,111 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:09,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 01:19:09,112 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:09,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:09,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1738119643, now seen corresponding path program 1 times [2024-11-19 01:19:09,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:09,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109200635] [2024-11-19 01:19:09,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:09,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:09,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:09,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109200635] [2024-11-19 01:19:09,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109200635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:09,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:09,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:19:09,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806868129] [2024-11-19 01:19:09,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:09,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:19:09,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:09,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:19:09,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:09,409 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:09,458 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-11-19 01:19:09,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:19:09,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-19 01:19:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:09,465 INFO L225 Difference]: With dead ends: 218 [2024-11-19 01:19:09,465 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 01:19:09,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:09,467 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:09,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 446 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:09,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 01:19:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-19 01:19:09,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-19 01:19:09,490 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 115 [2024-11-19 01:19:09,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:09,490 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-19 01:19:09,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-19 01:19:09,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 01:19:09,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:09,495 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:09,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:19:09,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:09,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:09,497 INFO L85 PathProgramCache]: Analyzing trace with hash 36887719, now seen corresponding path program 1 times [2024-11-19 01:19:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:09,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203503471] [2024-11-19 01:19:09,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:09,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:09,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:09,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203503471] [2024-11-19 01:19:09,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203503471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:09,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:09,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:19:09,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643185734] [2024-11-19 01:19:09,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:09,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:19:09,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:09,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:19:09,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:09,767 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:09,805 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-19 01:19:09,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:19:09,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-19 01:19:09,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:09,808 INFO L225 Difference]: With dead ends: 222 [2024-11-19 01:19:09,810 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 01:19:09,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:09,813 INFO L432 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-19 01:19:09,814 INFO L433 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-19 01:19:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 01:19:09,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-19 01:19:09,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:09,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-19 01:19:09,830 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 115 [2024-11-19 01:19:09,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:09,831 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-19 01:19:09,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:09,831 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-19 01:19:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 01:19:09,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:09,834 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:09,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:19:09,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:09,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:09,835 INFO L85 PathProgramCache]: Analyzing trace with hash 38734761, now seen corresponding path program 1 times [2024-11-19 01:19:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:09,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885379517] [2024-11-19 01:19:09,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:10,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:10,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885379517] [2024-11-19 01:19:10,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885379517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:10,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:10,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:19:10,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238780864] [2024-11-19 01:19:10,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:10,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:19:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:10,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:19:10,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:19:10,025 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:10,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:10,047 INFO L93 Difference]: Finished difference Result 223 states and 319 transitions. [2024-11-19 01:19:10,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:19:10,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-11-19 01:19:10,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:10,049 INFO L225 Difference]: With dead ends: 223 [2024-11-19 01:19:10,050 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 01:19:10,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:19:10,051 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:10,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:10,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 01:19:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-19 01:19:10,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3737373737373737) internal successors, (136), 99 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 160 transitions. [2024-11-19 01:19:10,068 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 160 transitions. Word has length 115 [2024-11-19 01:19:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:10,068 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 160 transitions. [2024-11-19 01:19:10,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:10,069 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 160 transitions. [2024-11-19 01:19:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 01:19:10,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:10,072 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:10,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:19:10,073 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:10,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:10,073 INFO L85 PathProgramCache]: Analyzing trace with hash -257716476, now seen corresponding path program 1 times [2024-11-19 01:19:10,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:10,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268900279] [2024-11-19 01:19:10,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:10,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:11,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:11,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268900279] [2024-11-19 01:19:11,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268900279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:11,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:11,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:19:11,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000884254] [2024-11-19 01:19:11,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:11,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:19:11,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:11,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:19:11,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:19:11,934 INFO L87 Difference]: Start difference. First operand 113 states and 160 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:19:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:12,754 INFO L93 Difference]: Finished difference Result 394 states and 556 transitions. [2024-11-19 01:19:12,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:19:12,754 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-19 01:19:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:12,757 INFO L225 Difference]: With dead ends: 394 [2024-11-19 01:19:12,757 INFO L226 Difference]: Without dead ends: 284 [2024-11-19 01:19:12,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:19:12,762 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 242 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:12,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 725 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:19:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-19 01:19:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 172. [2024-11-19 01:19:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 145 states have (on average 1.3724137931034484) internal successors, (199), 145 states have internal predecessors, (199), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:19:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 247 transitions. [2024-11-19 01:19:12,796 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 247 transitions. Word has length 117 [2024-11-19 01:19:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:12,797 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 247 transitions. [2024-11-19 01:19:12,797 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:19:12,798 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 247 transitions. [2024-11-19 01:19:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 01:19:12,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:12,800 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:12,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:19:12,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:12,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:12,801 INFO L85 PathProgramCache]: Analyzing trace with hash 37312769, now seen corresponding path program 1 times [2024-11-19 01:19:12,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:12,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821836120] [2024-11-19 01:19:12,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:13,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:13,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821836120] [2024-11-19 01:19:13,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821836120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:13,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:13,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:19:13,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013874050] [2024-11-19 01:19:13,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:13,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:19:13,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:13,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:19:13,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:19:13,114 INFO L87 Difference]: Start difference. First operand 172 states and 247 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:13,374 INFO L93 Difference]: Finished difference Result 340 states and 482 transitions. [2024-11-19 01:19:13,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:19:13,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-19 01:19:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:13,377 INFO L225 Difference]: With dead ends: 340 [2024-11-19 01:19:13,377 INFO L226 Difference]: Without dead ends: 230 [2024-11-19 01:19:13,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:19:13,381 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 62 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:13,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 474 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:19:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-19 01:19:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 175. [2024-11-19 01:19:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 148 states have (on average 1.364864864864865) internal successors, (202), 148 states have internal predecessors, (202), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:19:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 250 transitions. [2024-11-19 01:19:13,401 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 250 transitions. Word has length 118 [2024-11-19 01:19:13,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:13,401 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 250 transitions. [2024-11-19 01:19:13,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 250 transitions. [2024-11-19 01:19:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 01:19:13,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:13,403 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:13,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:19:13,403 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:13,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:13,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1227907559, now seen corresponding path program 1 times [2024-11-19 01:19:13,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:13,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290515133] [2024-11-19 01:19:13,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:13,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:14,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:14,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290515133] [2024-11-19 01:19:14,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290515133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:14,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:14,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:19:14,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121298732] [2024-11-19 01:19:14,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:14,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:19:14,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:14,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:19:14,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:19:14,856 INFO L87 Difference]: Start difference. First operand 175 states and 250 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:19:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:15,365 INFO L93 Difference]: Finished difference Result 296 states and 420 transitions. [2024-11-19 01:19:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:19:15,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2024-11-19 01:19:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:15,368 INFO L225 Difference]: With dead ends: 296 [2024-11-19 01:19:15,368 INFO L226 Difference]: Without dead ends: 181 [2024-11-19 01:19:15,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:19:15,370 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 230 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:15,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 402 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:19:15,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-19 01:19:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2024-11-19 01:19:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 152 states have (on average 1.355263157894737) internal successors, (206), 152 states have internal predecessors, (206), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:19:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 254 transitions. [2024-11-19 01:19:15,395 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 254 transitions. Word has length 119 [2024-11-19 01:19:15,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:15,395 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 254 transitions. [2024-11-19 01:19:15,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:19:15,396 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 254 transitions. [2024-11-19 01:19:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 01:19:15,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:15,397 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:15,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:19:15,398 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:15,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:15,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1143831703, now seen corresponding path program 1 times [2024-11-19 01:19:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:15,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58767206] [2024-11-19 01:19:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:16,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58767206] [2024-11-19 01:19:16,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58767206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:16,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:16,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:19:16,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022893605] [2024-11-19 01:19:16,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:16,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:19:16,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:16,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:19:16,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:19:16,543 INFO L87 Difference]: Start difference. First operand 179 states and 254 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:17,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:17,033 INFO L93 Difference]: Finished difference Result 355 states and 497 transitions. [2024-11-19 01:19:17,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:19:17,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2024-11-19 01:19:17,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:17,036 INFO L225 Difference]: With dead ends: 355 [2024-11-19 01:19:17,036 INFO L226 Difference]: Without dead ends: 240 [2024-11-19 01:19:17,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:19:17,037 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 233 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:17,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 612 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:19:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-19 01:19:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 199. [2024-11-19 01:19:17,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 172 states have (on average 1.3430232558139534) internal successors, (231), 172 states have internal predecessors, (231), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-19 01:19:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 279 transitions. [2024-11-19 01:19:17,068 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 279 transitions. Word has length 119 [2024-11-19 01:19:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:17,068 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 279 transitions. [2024-11-19 01:19:17,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:17,069 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 279 transitions. [2024-11-19 01:19:17,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 01:19:17,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:17,070 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:17,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 01:19:17,070 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:17,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:17,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1351634020, now seen corresponding path program 1 times [2024-11-19 01:19:17,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:17,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966926760] [2024-11-19 01:19:17,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:17,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:19,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:19,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966926760] [2024-11-19 01:19:19,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966926760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:19,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:19,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:19:19,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769184126] [2024-11-19 01:19:19,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:19,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:19:19,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:19,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:19:19,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:19:19,258 INFO L87 Difference]: Start difference. First operand 199 states and 279 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:19:19,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:19,715 INFO L93 Difference]: Finished difference Result 442 states and 620 transitions. [2024-11-19 01:19:19,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:19:19,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 119 [2024-11-19 01:19:19,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:19,718 INFO L225 Difference]: With dead ends: 442 [2024-11-19 01:19:19,718 INFO L226 Difference]: Without dead ends: 309 [2024-11-19 01:19:19,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:19:19,719 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 202 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:19,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 586 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 01:19:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-19 01:19:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2024-11-19 01:19:19,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 266 states have (on average 1.349624060150376) internal successors, (359), 266 states have internal predecessors, (359), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:19:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 431 transitions. [2024-11-19 01:19:19,751 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 431 transitions. Word has length 119 [2024-11-19 01:19:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:19,751 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 431 transitions. [2024-11-19 01:19:19,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:19:19,752 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 431 transitions. [2024-11-19 01:19:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 01:19:19,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:19,753 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:19,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 01:19:19,753 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:19,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1102352610, now seen corresponding path program 1 times [2024-11-19 01:19:19,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:19,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87930237] [2024-11-19 01:19:19,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:19,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 01:19:19,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:19,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87930237] [2024-11-19 01:19:19,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87930237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:19:19,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440632013] [2024-11-19 01:19:19,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:19,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:19:19,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:19:19,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:19:19,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 01:19:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:20,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:19:20,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:20,312 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:20,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440632013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:20,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:19:20,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-19 01:19:20,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877786933] [2024-11-19 01:19:20,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:20,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:19:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:19:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:19:20,314 INFO L87 Difference]: Start difference. First operand 306 states and 431 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:20,388 INFO L93 Difference]: Finished difference Result 552 states and 776 transitions. [2024-11-19 01:19:20,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:19:20,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-19 01:19:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:20,392 INFO L225 Difference]: With dead ends: 552 [2024-11-19 01:19:20,393 INFO L226 Difference]: Without dead ends: 312 [2024-11-19 01:19:20,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:19:20,394 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:20,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 587 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:20,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-19 01:19:20,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-11-19 01:19:20,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 272 states have (on average 1.3419117647058822) internal successors, (365), 272 states have internal predecessors, (365), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:19:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 437 transitions. [2024-11-19 01:19:20,443 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 437 transitions. Word has length 121 [2024-11-19 01:19:20,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:20,443 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 437 transitions. [2024-11-19 01:19:20,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 437 transitions. [2024-11-19 01:19:20,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 01:19:20,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:20,446 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:20,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:19:20,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 01:19:20,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:20,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:20,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2113469860, now seen corresponding path program 1 times [2024-11-19 01:19:20,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:20,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166838880] [2024-11-19 01:19:20,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:20,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:20,976 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:20,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:20,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166838880] [2024-11-19 01:19:20,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166838880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:20,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:20,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:19:20,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864789611] [2024-11-19 01:19:20,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:20,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:19:20,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:19:20,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:19:20,979 INFO L87 Difference]: Start difference. First operand 312 states and 437 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:21,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:21,214 INFO L93 Difference]: Finished difference Result 634 states and 879 transitions. [2024-11-19 01:19:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:19:21,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-19 01:19:21,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:21,217 INFO L225 Difference]: With dead ends: 634 [2024-11-19 01:19:21,217 INFO L226 Difference]: Without dead ends: 388 [2024-11-19 01:19:21,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:19:21,218 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 41 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:21,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 489 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:19:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-19 01:19:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 318. [2024-11-19 01:19:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 278 states have (on average 1.341726618705036) internal successors, (373), 278 states have internal predecessors, (373), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:19:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 445 transitions. [2024-11-19 01:19:21,248 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 445 transitions. Word has length 121 [2024-11-19 01:19:21,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:21,249 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 445 transitions. [2024-11-19 01:19:21,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 445 transitions. [2024-11-19 01:19:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 01:19:21,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:21,251 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:21,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 01:19:21,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:21,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2054832001, now seen corresponding path program 1 times [2024-11-19 01:19:21,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:21,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150960034] [2024-11-19 01:19:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:23,545 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:23,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:23,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150960034] [2024-11-19 01:19:23,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150960034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:23,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:19:23,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176683475] [2024-11-19 01:19:23,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:23,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:19:23,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:23,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:19:23,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:19:23,548 INFO L87 Difference]: Start difference. First operand 318 states and 445 transitions. Second operand has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:19:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:24,401 INFO L93 Difference]: Finished difference Result 634 states and 880 transitions. [2024-11-19 01:19:24,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:19:24,403 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 121 [2024-11-19 01:19:24,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:24,405 INFO L225 Difference]: With dead ends: 634 [2024-11-19 01:19:24,405 INFO L226 Difference]: Without dead ends: 382 [2024-11-19 01:19:24,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:19:24,408 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 340 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:24,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 589 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:19:24,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-19 01:19:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 337. [2024-11-19 01:19:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 297 states have (on average 1.3333333333333333) internal successors, (396), 297 states have internal predecessors, (396), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:19:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 468 transitions. [2024-11-19 01:19:24,460 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 468 transitions. Word has length 121 [2024-11-19 01:19:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:24,460 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 468 transitions. [2024-11-19 01:19:24,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.4) internal successors, (64), 11 states have internal predecessors, (64), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:19:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 468 transitions. [2024-11-19 01:19:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 01:19:24,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:24,463 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:24,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 01:19:24,463 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:24,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:24,464 INFO L85 PathProgramCache]: Analyzing trace with hash -784431070, now seen corresponding path program 1 times [2024-11-19 01:19:24,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:24,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927884734] [2024-11-19 01:19:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:24,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 01:19:24,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:24,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927884734] [2024-11-19 01:19:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927884734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:19:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961710692] [2024-11-19 01:19:24,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:24,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:19:24,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:19:24,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 01:19:24,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 01:19:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:24,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:19:24,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:24,998 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:24,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961710692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:24,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:19:24,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-11-19 01:19:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821416965] [2024-11-19 01:19:24,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:25,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:19:25,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:25,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:19:25,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:19:25,001 INFO L87 Difference]: Start difference. First operand 337 states and 468 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:25,054 INFO L93 Difference]: Finished difference Result 610 states and 845 transitions. [2024-11-19 01:19:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:19:25,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-19 01:19:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:25,056 INFO L225 Difference]: With dead ends: 610 [2024-11-19 01:19:25,056 INFO L226 Difference]: Without dead ends: 343 [2024-11-19 01:19:25,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:19:25,058 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:25,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:25,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-19 01:19:25,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2024-11-19 01:19:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 303 states have (on average 1.3267326732673268) internal successors, (402), 303 states have internal predecessors, (402), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:19:25,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 474 transitions. [2024-11-19 01:19:25,092 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 474 transitions. Word has length 122 [2024-11-19 01:19:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:25,093 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 474 transitions. [2024-11-19 01:19:25,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:25,093 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 474 transitions. [2024-11-19 01:19:25,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 01:19:25,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:25,094 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:25,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 01:19:25,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 01:19:25,296 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:25,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:25,296 INFO L85 PathProgramCache]: Analyzing trace with hash -43600819, now seen corresponding path program 1 times [2024-11-19 01:19:25,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:25,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463710212] [2024-11-19 01:19:25,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:25,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:25,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:25,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463710212] [2024-11-19 01:19:25,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463710212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:25,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:25,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:19:25,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608955408] [2024-11-19 01:19:25,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:25,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:19:25,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:25,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:19:25,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:19:25,371 INFO L87 Difference]: Start difference. First operand 343 states and 474 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:25,403 INFO L93 Difference]: Finished difference Result 515 states and 710 transitions. [2024-11-19 01:19:25,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:19:25,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-19 01:19:25,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:25,406 INFO L225 Difference]: With dead ends: 515 [2024-11-19 01:19:25,406 INFO L226 Difference]: Without dead ends: 346 [2024-11-19 01:19:25,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:19:25,408 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:25,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 300 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-19 01:19:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2024-11-19 01:19:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 305 states have (on average 1.3245901639344262) internal successors, (404), 305 states have internal predecessors, (404), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:19:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 476 transitions. [2024-11-19 01:19:25,440 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 476 transitions. Word has length 122 [2024-11-19 01:19:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:25,440 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 476 transitions. [2024-11-19 01:19:25,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 476 transitions. [2024-11-19 01:19:25,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 01:19:25,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:25,442 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:25,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 01:19:25,442 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:25,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:25,443 INFO L85 PathProgramCache]: Analyzing trace with hash -745200693, now seen corresponding path program 1 times [2024-11-19 01:19:25,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:25,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131955582] [2024-11-19 01:19:25,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:25,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:25,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:25,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131955582] [2024-11-19 01:19:25,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131955582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:19:25,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70217604] [2024-11-19 01:19:25,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:25,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:19:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:19:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:19:25,893 INFO L87 Difference]: Start difference. First operand 345 states and 476 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:26,247 INFO L93 Difference]: Finished difference Result 745 states and 1013 transitions. [2024-11-19 01:19:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 01:19:26,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2024-11-19 01:19:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:26,250 INFO L225 Difference]: With dead ends: 745 [2024-11-19 01:19:26,250 INFO L226 Difference]: Without dead ends: 460 [2024-11-19 01:19:26,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 01:19:26,251 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 176 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:26,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 569 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:19:26,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-19 01:19:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 370. [2024-11-19 01:19:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 330 states have (on average 1.3151515151515152) internal successors, (434), 330 states have internal predecessors, (434), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:19:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 506 transitions. [2024-11-19 01:19:26,284 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 506 transitions. Word has length 122 [2024-11-19 01:19:26,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:26,285 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 506 transitions. [2024-11-19 01:19:26,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:26,285 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 506 transitions. [2024-11-19 01:19:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:19:26,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:26,286 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:26,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 01:19:26,287 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:26,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:26,287 INFO L85 PathProgramCache]: Analyzing trace with hash -394872803, now seen corresponding path program 1 times [2024-11-19 01:19:26,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:26,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568660541] [2024-11-19 01:19:26,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:26,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:26,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:26,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568660541] [2024-11-19 01:19:26,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568660541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:26,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:26,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:19:26,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033808564] [2024-11-19 01:19:26,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:26,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:19:26,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:26,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:19:26,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:19:26,614 INFO L87 Difference]: Start difference. First operand 370 states and 506 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:26,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:26,847 INFO L93 Difference]: Finished difference Result 731 states and 994 transitions. [2024-11-19 01:19:26,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:19:26,848 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-11-19 01:19:26,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:26,851 INFO L225 Difference]: With dead ends: 731 [2024-11-19 01:19:26,851 INFO L226 Difference]: Without dead ends: 452 [2024-11-19 01:19:26,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:19:26,853 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 124 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:26,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 481 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:19:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-19 01:19:26,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 368. [2024-11-19 01:19:26,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 328 states have (on average 1.3048780487804879) internal successors, (428), 328 states have internal predecessors, (428), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:19:26,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 500 transitions. [2024-11-19 01:19:26,887 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 500 transitions. Word has length 124 [2024-11-19 01:19:26,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:26,887 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 500 transitions. [2024-11-19 01:19:26,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:26,887 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 500 transitions. [2024-11-19 01:19:26,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 01:19:26,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:26,889 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:26,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 01:19:26,890 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:26,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:26,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2083816545, now seen corresponding path program 1 times [2024-11-19 01:19:26,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:26,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499984561] [2024-11-19 01:19:26,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:26,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:29,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:29,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499984561] [2024-11-19 01:19:29,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499984561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:29,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:29,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:19:29,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995537881] [2024-11-19 01:19:29,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:29,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:19:29,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:29,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:19:29,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:19:29,021 INFO L87 Difference]: Start difference. First operand 368 states and 500 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:19:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:29,648 INFO L93 Difference]: Finished difference Result 564 states and 762 transitions. [2024-11-19 01:19:29,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:19:29,648 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 124 [2024-11-19 01:19:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:29,651 INFO L225 Difference]: With dead ends: 564 [2024-11-19 01:19:29,651 INFO L226 Difference]: Without dead ends: 401 [2024-11-19 01:19:29,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:19:29,652 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 376 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:29,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 483 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 01:19:29,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-19 01:19:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 357. [2024-11-19 01:19:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 317 states have (on average 1.3028391167192428) internal successors, (413), 317 states have internal predecessors, (413), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:19:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 485 transitions. [2024-11-19 01:19:29,684 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 485 transitions. Word has length 124 [2024-11-19 01:19:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:29,685 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 485 transitions. [2024-11-19 01:19:29,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:19:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 485 transitions. [2024-11-19 01:19:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 01:19:29,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:29,686 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:29,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 01:19:29,687 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:29,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:29,688 INFO L85 PathProgramCache]: Analyzing trace with hash 786667071, now seen corresponding path program 1 times [2024-11-19 01:19:29,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:29,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995690831] [2024-11-19 01:19:29,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:29,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:29,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:19:29,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995690831] [2024-11-19 01:19:29,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995690831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:29,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:29,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 01:19:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998543337] [2024-11-19 01:19:29,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:29,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 01:19:29,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:19:29,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 01:19:29,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:19:29,818 INFO L87 Difference]: Start difference. First operand 357 states and 485 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:29,856 INFO L93 Difference]: Finished difference Result 634 states and 863 transitions. [2024-11-19 01:19:29,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 01:19:29,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 126 [2024-11-19 01:19:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:29,859 INFO L225 Difference]: With dead ends: 634 [2024-11-19 01:19:29,859 INFO L226 Difference]: Without dead ends: 357 [2024-11-19 01:19:29,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 01:19:29,861 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:29,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-19 01:19:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-11-19 01:19:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 317 states have (on average 1.2965299684542586) internal successors, (411), 317 states have internal predecessors, (411), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 01:19:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 483 transitions. [2024-11-19 01:19:29,906 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 483 transitions. Word has length 126 [2024-11-19 01:19:29,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:29,906 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 483 transitions. [2024-11-19 01:19:29,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:29,907 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 483 transitions. [2024-11-19 01:19:29,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 01:19:29,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:29,908 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:29,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 01:19:29,908 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:29,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash 253819977, now seen corresponding path program 1 times [2024-11-19 01:19:29,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:19:29,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069757709] [2024-11-19 01:19:29,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:29,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:19:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:19:30,077 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:19:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:19:30,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:19:30,290 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:19:30,292 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:19:30,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 01:19:30,296 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:30,436 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:19:30,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:19:30 BoogieIcfgContainer [2024-11-19 01:19:30,440 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:19:30,440 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:19:30,441 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:19:30,441 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:19:30,441 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:19:08" (3/4) ... [2024-11-19 01:19:30,443 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:19:30,444 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:19:30,445 INFO L158 Benchmark]: Toolchain (without parser) took 23765.57ms. Allocated memory was 176.2MB in the beginning and 752.9MB in the end (delta: 576.7MB). Free memory was 103.8MB in the beginning and 550.4MB in the end (delta: -446.6MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. [2024-11-19 01:19:30,445 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory was 130.4MB in the beginning and 130.2MB in the end (delta: 160.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:19:30,446 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.70ms. Allocated memory is still 176.2MB. Free memory was 103.6MB in the beginning and 86.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 01:19:30,446 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.49ms. Allocated memory is still 176.2MB. Free memory was 86.3MB in the beginning and 143.5MB in the end (delta: -57.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-11-19 01:19:30,446 INFO L158 Benchmark]: Boogie Preprocessor took 64.25ms. Allocated memory is still 176.2MB. Free memory was 143.5MB in the beginning and 140.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:19:30,446 INFO L158 Benchmark]: RCFGBuilder took 842.36ms. Allocated memory is still 176.2MB. Free memory was 140.6MB in the beginning and 104.3MB in the end (delta: 36.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 01:19:30,447 INFO L158 Benchmark]: TraceAbstraction took 22362.40ms. Allocated memory was 176.2MB in the beginning and 752.9MB in the end (delta: 576.7MB). Free memory was 103.6MB in the beginning and 550.4MB in the end (delta: -446.8MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. [2024-11-19 01:19:30,447 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 752.9MB. Free memory is still 550.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:19:30,451 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory was 130.4MB in the beginning and 130.2MB in the end (delta: 160.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.70ms. Allocated memory is still 176.2MB. Free memory was 103.6MB in the beginning and 86.3MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.49ms. Allocated memory is still 176.2MB. Free memory was 86.3MB in the beginning and 143.5MB in the end (delta: -57.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.25ms. Allocated memory is still 176.2MB. Free memory was 143.5MB in the beginning and 140.6MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 842.36ms. Allocated memory is still 176.2MB. Free memory was 140.6MB in the beginning and 104.3MB in the end (delta: 36.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 22362.40ms. Allocated memory was 176.2MB in the beginning and 752.9MB in the end (delta: 576.7MB). Free memory was 103.6MB in the beginning and 550.4MB in the end (delta: -446.8MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 752.9MB. Free memory is still 550.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of shiftRight at line 93, overapproximation of someBinaryArithmeticDOUBLEoperation at line 88. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 10, 0, 0, 256.75, 63.5, 1.8, 0.25, 16.5, -5, 128, 4.6, 500, 2, 100 }; [L55] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L58] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L59] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L60] double* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L61] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L63] signed long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L64] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L65] float* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L66] unsigned long int* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L67] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L68] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L69] signed long int last_1_WrapperStruct00_var_1_12 = -5; [L70] unsigned char last_1_WrapperStruct00_var_1_17 = 2; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=0, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L126] EXPR WrapperStruct00.var_1_12 [L126] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L127] EXPR WrapperStruct00.var_1_17 [L127] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L104] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L107] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L110] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_8 [L111] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_8 [L111] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L112] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L113] EXPR WrapperStruct00.var_1_9 [L113] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L113] EXPR WrapperStruct00.var_1_9 [L113] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L113] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L114] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L115] EXPR WrapperStruct00.var_1_10 [L115] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L115] EXPR WrapperStruct00.var_1_10 [L115] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L115] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L116] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L117] EXPR WrapperStruct00.var_1_11 [L117] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_11 [L117] EXPR WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] EXPR (WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 0.0F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L121] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L138] RET updateVariables() [L139] CALL step() [L74] unsigned char stepLocal_1 = last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17; [L75] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_17; [L76] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_1=0] [L76] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L77] stepLocal_1 && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L77] COND FALSE !(stepLocal_1 && (*(WrapperStruct00_var_1_5_Pointer))) [L87] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L87] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L88] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L88] (*(WrapperStruct00_var_1_7_Pointer)) = ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))) [L90] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L90] (*(WrapperStruct00_var_1_15_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L91] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L91] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L92] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L92] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR -4 >> (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR (((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR -4 >> (*(WrapperStruct00_var_1_1_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] EXPR (((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2] [L93] signed long int stepLocal_3 = ((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))); [L94] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L94] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_1_Pointer)) / -8; [L95] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2, stepLocal_0=2, stepLocal_2=-1, stepLocal_3=-5] [L95] COND FALSE !((~ (*(WrapperStruct00_var_1_17_Pointer))) <= stepLocal_3) [L100] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L100] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L100] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17)) [L130] EXPR (last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1) [L130] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1 [L130] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L130] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130] EXPR ((((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L130-L131] return ((((((*(WrapperStruct00_var_1_2_Pointer)) ? (((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) && (*(WrapperStruct00_var_1_5_Pointer))) ? ((last_1_WrapperStruct00_var_1_12 >= last_1_WrapperStruct00_var_1_17) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 5)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((25) < (last_1_WrapperStruct00_var_1_17)) ? (25) : (last_1_WrapperStruct00_var_1_17)))))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) last_1_WrapperStruct00_var_1_17))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) ((((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))) + (*(WrapperStruct00_var_1_10_Pointer))) - (*(WrapperStruct00_var_1_11_Pointer))))) : 1)) && (((~ (*(WrapperStruct00_var_1_17_Pointer))) <= (((((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? ((-4 >> (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)))))) ? ((((*(WrapperStruct00_var_1_14_Pointer)) - 64) < ((*(WrapperStruct00_var_1_1_Pointer)) / -8)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_1_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_17_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer))))))) && ((*(WrapperStruct00_var_1_15_Pointer)) == ((float) (*(WrapperStruct00_var_1_8_Pointer))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_14_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:28}, WrapperStruct00_var_1_11_Pointer={4:36}, WrapperStruct00_var_1_12_Pointer={4:44}, WrapperStruct00_var_1_14_Pointer={4:48}, WrapperStruct00_var_1_15_Pointer={4:49}, WrapperStruct00_var_1_16_Pointer={4:53}, WrapperStruct00_var_1_17_Pointer={4:57}, WrapperStruct00_var_1_18_Pointer={4:58}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:4}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, last_1_WrapperStruct00_var_1_12=-5, last_1_WrapperStruct00_var_1_17=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 19, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2032 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2029 mSDsluCounter, 8828 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6244 mSDsCounter, 237 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3057 IncrementalHoareTripleChecker+Invalid, 3294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 237 mSolverCounterUnsat, 2584 mSDtfsCounter, 3057 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 416 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=370occurred in iteration=15, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 550 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 2524 NumberOfCodeBlocks, 2524 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2378 ConstructedInterpolants, 0 QuantifiedInterpolants, 12949 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1016 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 5214/5280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 01:19:30,488 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-55.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 f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:19:32,832 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:19:32,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:19:32,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:19:32,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:19:32,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:19:32,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:19:32,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:19:32,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:19:32,965 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:19:32,966 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:19:32,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:19:32,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:19:32,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:19:32,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:19:32,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:19:32,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:19:32,969 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:19:32,969 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:19:32,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:19:32,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:19:32,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:19:32,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:19:32,975 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:19:32,975 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:19:32,975 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:19:32,975 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:19:32,976 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:19:32,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:19:32,976 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:19:32,976 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:19:32,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:19:32,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:19:32,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:19:32,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:19:32,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:19:32,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:19:32,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:19:32,980 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:19:32,980 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:19:32,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:19:32,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:19:32,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:19:32,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:19:32,981 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 -> f20e9f2923b6fcf76854633fa4b44cb969c28b9197113751a22d94911b3dd6da [2024-11-19 01:19:33,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:19:33,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:19:33,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:19:33,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:19:33,344 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:19:33,345 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-55.i [2024-11-19 01:19:34,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:19:35,183 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:19:35,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-55.i [2024-11-19 01:19:35,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/587015cd6/d70f12ef4fa74344b92288f49d6c1066/FLAG998c399d0 [2024-11-19 01:19:35,540 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/587015cd6/d70f12ef4fa74344b92288f49d6c1066 [2024-11-19 01:19:35,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:19:35,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:19:35,545 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:19:35,545 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:19:35,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:19:35,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:35,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@737c784c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35, skipping insertion in model container [2024-11-19 01:19:35,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:35,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:19:35,793 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-55.i[917,930] [2024-11-19 01:19:35,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:19:35,897 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:19:35,912 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-55.i[917,930] [2024-11-19 01:19:35,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:19:35,994 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:19:35,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35 WrapperNode [2024-11-19 01:19:35,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:19:35,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:19:35,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:19:35,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:19:36,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,074 INFO L138 Inliner]: procedures = 40, calls = 132, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2024-11-19 01:19:36,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:19:36,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:19:36,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:19:36,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:19:36,088 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,096 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,137 INFO L175 MemorySlicer]: Split 109 memory accesses to 2 slices as follows [2, 107]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-19 01:19:36,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,138 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,158 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:19:36,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:19:36,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:19:36,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:19:36,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (1/1) ... [2024-11-19 01:19:36,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:19:36,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:19:36,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 01:19:36,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 01:19:36,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:19:36,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:19:36,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:19:36,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-19 01:19:36,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-19 01:19:36,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:19:36,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:19:36,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:19:36,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:19:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:19:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:19:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:19:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:19:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:19:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:19:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:19:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:19:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-19 01:19:36,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-19 01:19:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:19:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:19:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:19:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:19:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:19:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:19:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:19:36,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:19:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-19 01:19:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-19 01:19:36,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:19:36,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:19:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:19:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:19:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:19:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:19:36,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:19:36,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:19:36,465 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:19:36,467 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:19:41,617 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-19 01:19:41,618 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:19:41,634 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:19:41,634 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:19:41,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:19:41 BoogieIcfgContainer [2024-11-19 01:19:41,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:19:41,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:19:41,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:19:41,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:19:41,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:19:35" (1/3) ... [2024-11-19 01:19:41,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9c751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:19:41, skipping insertion in model container [2024-11-19 01:19:41,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:19:35" (2/3) ... [2024-11-19 01:19:41,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9c751 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:19:41, skipping insertion in model container [2024-11-19 01:19:41,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:19:41" (3/3) ... [2024-11-19 01:19:41,643 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-55.i [2024-11-19 01:19:41,659 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:19:41,659 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:19:41,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:19:41,739 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;@2d25ee4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:19:41,740 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:19:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 01:19:41,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:41,760 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:41,760 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:41,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2007882332, now seen corresponding path program 1 times [2024-11-19 01:19:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:19:41,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420460153] [2024-11-19 01:19:41,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:41,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:19:41,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:19:41,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:19:41,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 01:19:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:42,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:19:42,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-19 01:19:42,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:42,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:19:42,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420460153] [2024-11-19 01:19:42,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420460153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:42,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:42,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:19:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28673230] [2024-11-19 01:19:42,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:42,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:19:42,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:19:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:19:42,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:19:42,494 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:19:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:42,530 INFO L93 Difference]: Finished difference Result 191 states and 298 transitions. [2024-11-19 01:19:42,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:19:42,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-11-19 01:19:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:42,543 INFO L225 Difference]: With dead ends: 191 [2024-11-19 01:19:42,544 INFO L226 Difference]: Without dead ends: 95 [2024-11-19 01:19:42,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:19:42,554 INFO L432 NwaCegarLoop]: 137 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, 137 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:42,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:19:42,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-19 01:19:42,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-19 01:19:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3950617283950617) internal successors, (113), 81 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-19 01:19:42,605 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 113 [2024-11-19 01:19:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:42,606 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-19 01:19:42,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:19:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-19 01:19:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 01:19:42,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:42,610 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:42,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 01:19:42,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:19:42,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:42,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash 104285460, now seen corresponding path program 1 times [2024-11-19 01:19:42,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:19:42,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218041152] [2024-11-19 01:19:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:42,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:19:42,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:19:42,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:19:42,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 01:19:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:43,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 01:19:43,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 01:19:43,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:43,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:19:43,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218041152] [2024-11-19 01:19:43,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218041152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:43,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:43,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:19:43,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641997617] [2024-11-19 01:19:43,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:43,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:19:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:19:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:19:43,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:43,515 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:19:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:43,636 INFO L93 Difference]: Finished difference Result 189 states and 274 transitions. [2024-11-19 01:19:43,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:19:43,637 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-11-19 01:19:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:43,639 INFO L225 Difference]: With dead ends: 189 [2024-11-19 01:19:43,639 INFO L226 Difference]: Without dead ends: 97 [2024-11-19 01:19:43,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:19:43,641 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:43,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 394 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:19:43,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-19 01:19:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-19 01:19:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 83 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:43,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-19 01:19:43,657 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 113 [2024-11-19 01:19:43,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:43,663 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-19 01:19:43,663 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), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:19:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-19 01:19:43,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 01:19:43,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:43,665 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:43,688 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 (3)] Ended with exit code 0 [2024-11-19 01:19:43,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:19:43,866 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:43,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:43,867 INFO L85 PathProgramCache]: Analyzing trace with hash 836252886, now seen corresponding path program 1 times [2024-11-19 01:19:43,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:19:43,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327573298] [2024-11-19 01:19:43,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:43,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:19:43,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:19:43,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:19:43,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 01:19:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:44,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 01:19:44,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:44,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:44,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:19:44,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327573298] [2024-11-19 01:19:44,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327573298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:44,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:44,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:19:44,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53191659] [2024-11-19 01:19:44,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:44,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:19:44,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:19:44,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:19:44,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:19:44,503 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:44,707 INFO L93 Difference]: Finished difference Result 196 states and 282 transitions. [2024-11-19 01:19:44,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:19:44,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-19 01:19:44,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:44,710 INFO L225 Difference]: With dead ends: 196 [2024-11-19 01:19:44,710 INFO L226 Difference]: Without dead ends: 102 [2024-11-19 01:19:44,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 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-19 01:19:44,712 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 512 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:44,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 512 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:19:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-19 01:19:44,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2024-11-19 01:19:44,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:44,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-19 01:19:44,724 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 113 [2024-11-19 01:19:44,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:44,725 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-19 01:19:44,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:44,725 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-19 01:19:44,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 01:19:44,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:44,729 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:44,754 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-19 01:19:44,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:19:44,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:44,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:44,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1516311256, now seen corresponding path program 1 times [2024-11-19 01:19:44,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:19:44,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [31698479] [2024-11-19 01:19:44,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:44,932 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:19:44,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:19:44,934 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:19:44,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 01:19:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:45,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:19:45,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:45,532 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:45,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:19:45,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [31698479] [2024-11-19 01:19:45,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [31698479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:45,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:19:45,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508230627] [2024-11-19 01:19:45,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:45,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:19:45,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:19:45,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:19:45,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:19:45,535 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:45,701 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-11-19 01:19:45,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:19:45,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-19 01:19:45,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:45,704 INFO L225 Difference]: With dead ends: 202 [2024-11-19 01:19:45,704 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 01:19:45,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:19:45,706 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:45,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 630 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 01:19:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 01:19:45,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-19 01:19:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.3595505617977528) internal successors, (121), 89 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-19 01:19:45,724 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 113 [2024-11-19 01:19:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:45,726 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-19 01:19:45,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:45,727 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-19 01:19:45,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 01:19:45,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:45,728 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:45,744 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 (5)] Ended with exit code 0 [2024-11-19 01:19:45,929 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-19 01:19:45,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:45,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1003648678, now seen corresponding path program 1 times [2024-11-19 01:19:45,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:19:45,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230466432] [2024-11-19 01:19:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:45,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:19:45,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:19:45,933 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-19 01:19:45,934 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-19 01:19:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:46,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 01:19:46,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-19 01:19:46,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:46,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:19:46,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230466432] [2024-11-19 01:19:46,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230466432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:46,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:46,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 01:19:46,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285447628] [2024-11-19 01:19:46,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:46,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 01:19:46,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:19:46,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 01:19:46,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:19:46,509 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:46,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:46,800 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-19 01:19:46,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:19:46,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-11-19 01:19:46,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:46,804 INFO L225 Difference]: With dead ends: 206 [2024-11-19 01:19:46,804 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:19:46,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:19:46,808 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:46,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 749 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:19:46,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:19:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-19 01:19:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-19 01:19:46,820 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 113 [2024-11-19 01:19:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:46,821 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-19 01:19:46,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 01:19:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-19 01:19:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 01:19:46,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:46,823 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:46,839 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-19 01:19:47,023 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-19 01:19:47,024 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:47,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:47,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1001801636, now seen corresponding path program 1 times [2024-11-19 01:19:47,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:19:47,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95876846] [2024-11-19 01:19:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:47,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:19:47,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:19:47,028 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-19 01:19:47,030 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-19 01:19:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:47,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:19:47,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:47,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:19:47,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-19 01:19:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-19 01:19:47,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:47,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:19:47,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95876846] [2024-11-19 01:19:47,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95876846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:47,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:47,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:19:47,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917176732] [2024-11-19 01:19:47,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:47,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:19:47,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:19:47,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:19:47,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:19:47,921 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:19:51,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:19:55,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:19:58,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:19:58,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:58,358 INFO L93 Difference]: Finished difference Result 208 states and 292 transitions. [2024-11-19 01:19:58,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:19:58,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-11-19 01:19:58,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:58,359 INFO L225 Difference]: With dead ends: 208 [2024-11-19 01:19:58,359 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:19:58,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:19:58,361 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 117 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:58,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 393 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2024-11-19 01:19:58,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:19:58,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-19 01:19:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:58,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 146 transitions. [2024-11-19 01:19:58,368 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 146 transitions. Word has length 113 [2024-11-19 01:19:58,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:58,369 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 146 transitions. [2024-11-19 01:19:58,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:19:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 146 transitions. [2024-11-19 01:19:58,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 01:19:58,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:58,370 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:58,389 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-19 01:19:58,571 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-19 01:19:58,571 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:58,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:58,572 INFO L85 PathProgramCache]: Analyzing trace with hash -766924584, now seen corresponding path program 1 times [2024-11-19 01:19:58,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:19:58,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455356913] [2024-11-19 01:19:58,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:58,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:19:58,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:19:58,574 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-19 01:19:58,575 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-19 01:19:59,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:19:59,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:19:59,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:19:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 01:19:59,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:19:59,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:19:59,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455356913] [2024-11-19 01:19:59,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455356913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:19:59,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:19:59,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:19:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384993965] [2024-11-19 01:19:59,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:19:59,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:19:59,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:19:59,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:19:59,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:19:59,100 INFO L87 Difference]: Start difference. First operand 105 states and 146 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:19:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:19:59,358 INFO L93 Difference]: Finished difference Result 211 states and 294 transitions. [2024-11-19 01:19:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:19:59,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 115 [2024-11-19 01:19:59,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:19:59,360 INFO L225 Difference]: With dead ends: 211 [2024-11-19 01:19:59,360 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 01:19:59,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:19:59,361 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:19:59,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 569 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 01:19:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 01:19:59,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2024-11-19 01:19:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:19:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 145 transitions. [2024-11-19 01:19:59,377 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 145 transitions. Word has length 115 [2024-11-19 01:19:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:19:59,381 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 145 transitions. [2024-11-19 01:19:59,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 01:19:59,382 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2024-11-19 01:19:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 01:19:59,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:19:59,383 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:19:59,410 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-19 01:19:59,583 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-19 01:19:59,584 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:19:59,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:19:59,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2091780778, now seen corresponding path program 1 times [2024-11-19 01:19:59,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:19:59,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316465277] [2024-11-19 01:19:59,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:19:59,585 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:19:59,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:19:59,586 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-19 01:19:59,587 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-19 01:20:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:20:00,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:20:00,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:20:00,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:20:00,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-19 01:20:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-19 01:20:00,418 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:20:00,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:20:00,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316465277] [2024-11-19 01:20:00,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316465277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:20:00,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:20:00,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:20:00,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008725796] [2024-11-19 01:20:00,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:20:00,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:20:00,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:20:00,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:20:00,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:20:00,421 INFO L87 Difference]: Start difference. First operand 105 states and 145 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:20:01,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:20:04,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:20:08,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:20:11,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:20:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:20:11,543 INFO L93 Difference]: Finished difference Result 208 states and 288 transitions. [2024-11-19 01:20:11,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:20:11,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-11-19 01:20:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:20:11,546 INFO L225 Difference]: With dead ends: 208 [2024-11-19 01:20:11,546 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:20:11,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:20:11,547 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 106 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-19 01:20:11,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 385 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2024-11-19 01:20:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:20:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-19 01:20:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:20:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2024-11-19 01:20:11,554 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 115 [2024-11-19 01:20:11,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:20:11,554 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2024-11-19 01:20:11,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:20:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2024-11-19 01:20:11,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 01:20:11,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:20:11,557 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:20:11,580 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-19 01:20:11,757 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-19 01:20:11,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:20:11,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:20:11,758 INFO L85 PathProgramCache]: Analyzing trace with hash 713823132, now seen corresponding path program 1 times [2024-11-19 01:20:11,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:20:11,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353875363] [2024-11-19 01:20:11,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:20:11,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:20:11,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:20:11,760 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-19 01:20:11,761 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-19 01:20:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:20:12,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:20:12,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:20:12,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:20:12,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2024-11-19 01:20:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 01:20:12,575 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:20:12,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:20:12,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353875363] [2024-11-19 01:20:12,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353875363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:20:12,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:20:12,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:20:12,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274618994] [2024-11-19 01:20:12,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:20:12,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:20:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:20:12,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:20:12,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:20:12,579 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:20:13,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:20:16,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:20:17,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:20:21,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:20:21,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:20:21,598 INFO L93 Difference]: Finished difference Result 207 states and 285 transitions. [2024-11-19 01:20:21,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:20:21,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2024-11-19 01:20:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:20:21,601 INFO L225 Difference]: With dead ends: 207 [2024-11-19 01:20:21,601 INFO L226 Difference]: Without dead ends: 105 [2024-11-19 01:20:21,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:20:21,602 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 98 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2024-11-19 01:20:21,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 381 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2024-11-19 01:20:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-19 01:20:21,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2024-11-19 01:20:21,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-19 01:20:21,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 141 transitions. [2024-11-19 01:20:21,609 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 141 transitions. Word has length 117 [2024-11-19 01:20:21,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:20:21,609 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 141 transitions. [2024-11-19 01:20:21,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 01:20:21,609 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 141 transitions. [2024-11-19 01:20:21,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 01:20:21,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:20:21,611 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:20:21,630 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 (10)] Forceful destruction successful, exit code 0 [2024-11-19 01:20:21,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:20:21,811 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:20:21,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:20:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash 899307348, now seen corresponding path program 1 times [2024-11-19 01:20:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:20:21,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694253714] [2024-11-19 01:20:21,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:20:21,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:20:21,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:20:21,814 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:20:21,816 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 (11)] Waiting until timeout for monitored process [2024-11-19 01:20:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:20:22,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 01:20:22,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:20:22,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:20:22,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 64 [2024-11-19 01:20:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 24 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-19 01:20:22,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:20:23,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:20:23,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 1 [2024-11-19 01:20:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-19 01:20:23,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:20:23,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694253714] [2024-11-19 01:20:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694253714] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:20:23,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:20:23,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-19 01:20:23,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177187626] [2024-11-19 01:20:23,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:20:23,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 01:20:23,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:20:23,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 01:20:23,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 01:20:23,328 INFO L87 Difference]: Start difference. First operand 103 states and 141 transitions. Second operand has 12 states, 11 states have (on average 8.909090909090908) internal successors, (98), 12 states have internal predecessors, (98), 4 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)