./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:16:42,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:16:42,968 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:16:42,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:16:42,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:16:43,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:16:43,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:16:43,003 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:16:43,003 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:16:43,004 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:16:43,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:16:43,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:16:43,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:16:43,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:16:43,013 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:16:43,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:16:43,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:16:43,014 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:16:43,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:16:43,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:16:43,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:16:43,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:16:43,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:16:43,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:16:43,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:16:43,016 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:16:43,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:16:43,016 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:16:43,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:16:43,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:16:43,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:16:43,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:16:43,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:16:43,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:16:43,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:16:43,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:16:43,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:16:43,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:16:43,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:16:43,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:16:43,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:16:43,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:16:43,020 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 [2024-11-09 02:16:43,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:16:43,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:16:43,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:16:43,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:16:43,302 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:16:43,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-09 02:16:44,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:16:44,920 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:16:44,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-09 02:16:44,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e237544/20629bd05e164f3293d62e660f4da436/FLAG1ed634b47 [2024-11-09 02:16:44,950 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e237544/20629bd05e164f3293d62e660f4da436 [2024-11-09 02:16:44,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:16:44,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:16:44,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:16:44,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:16:44,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:16:44,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:16:44" (1/1) ... [2024-11-09 02:16:44,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a37902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:44, skipping insertion in model container [2024-11-09 02:16:44,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:16:44" (1/1) ... [2024-11-09 02:16:45,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:16:45,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i[917,930] [2024-11-09 02:16:45,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:16:45,314 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:16:45,329 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i[917,930] [2024-11-09 02:16:45,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:16:45,436 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:16:45,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45 WrapperNode [2024-11-09 02:16:45,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:16:45,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:16:45,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:16:45,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:16:45,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,540 INFO L138 Inliner]: procedures = 30, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 506 [2024-11-09 02:16:45,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:16:45,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:16:45,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:16:45,546 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:16:45,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,587 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:16:45,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:16:45,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:16:45,650 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:16:45,650 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:16:45,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (1/1) ... [2024-11-09 02:16:45,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:16:45,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:16:45,690 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-09 02:16:45,694 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-09 02:16:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:16:45,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:16:45,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:16:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:16:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:16:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:16:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:16:45,737 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:16:45,738 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:16:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:16:45,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:16:45,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:16:45,866 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:16:45,868 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:16:46,453 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-09 02:16:46,454 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:16:46,476 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:16:46,476 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:16:46,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:16:46 BoogieIcfgContainer [2024-11-09 02:16:46,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:16:46,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:16:46,480 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:16:46,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:16:46,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:16:44" (1/3) ... [2024-11-09 02:16:46,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4491c257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:16:46, skipping insertion in model container [2024-11-09 02:16:46,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:16:45" (2/3) ... [2024-11-09 02:16:46,486 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4491c257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:16:46, skipping insertion in model container [2024-11-09 02:16:46,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:16:46" (3/3) ... [2024-11-09 02:16:46,488 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-09 02:16:46,507 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:16:46,507 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:16:46,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:16:46,576 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;@7ef67857, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:16:46,577 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:16:46,581 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:16:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 02:16:46,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:46,597 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:46,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:46,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:46,605 INFO L85 PathProgramCache]: Analyzing trace with hash -282641606, now seen corresponding path program 1 times [2024-11-09 02:16:46,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:46,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499305618] [2024-11-09 02:16:46,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:46,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:16:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:16:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:16:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:16:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:16:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:16:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:16:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:16:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:16:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:16:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:16:47,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:47,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499305618] [2024-11-09 02:16:47,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499305618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:47,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:47,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:16:47,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213675102] [2024-11-09 02:16:47,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:47,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:16:47,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:47,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:16:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:16:47,222 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:16:47,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:47,266 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-09 02:16:47,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:16:47,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-09 02:16:47,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:47,278 INFO L225 Difference]: With dead ends: 213 [2024-11-09 02:16:47,279 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 02:16:47,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:16:47,287 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:47,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:16:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 02:16:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 02:16:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:16:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-09 02:16:47,338 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-09 02:16:47,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:47,339 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-09 02:16:47,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:16:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-09 02:16:47,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 02:16:47,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:47,344 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:47,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:16:47,345 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:47,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:47,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1163314308, now seen corresponding path program 1 times [2024-11-09 02:16:47,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:47,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97145245] [2024-11-09 02:16:47,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:47,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:16:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:16:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:16:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:16:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:16:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:16:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:16:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:16:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:16:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:16:47,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:47,904 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:16:47,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:47,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97145245] [2024-11-09 02:16:47,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97145245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:47,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:47,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:16:47,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184372539] [2024-11-09 02:16:47,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:47,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:16:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:47,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:16:47,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:16:47,912 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:16:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:47,979 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-09 02:16:47,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:16:47,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-09 02:16:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:47,984 INFO L225 Difference]: With dead ends: 211 [2024-11-09 02:16:47,985 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 02:16:47,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:16:47,987 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:47,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:16:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 02:16:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 02:16:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:16:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-09 02:16:48,012 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-09 02:16:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:48,015 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-09 02:16:48,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:16:48,016 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-09 02:16:48,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 02:16:48,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:48,020 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:48,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:16:48,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:48,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:48,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1992987499, now seen corresponding path program 1 times [2024-11-09 02:16:48,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:48,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337658494] [2024-11-09 02:16:48,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:48,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:16:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:16:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:16:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:16:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:16:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:16:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:16:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:16:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:16:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:16:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:16:48,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:48,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337658494] [2024-11-09 02:16:48,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337658494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:48,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:48,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:16:48,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529009604] [2024-11-09 02:16:48,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:48,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:16:48,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:48,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:16:48,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:16:48,309 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:16:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:48,355 INFO L93 Difference]: Finished difference Result 216 states and 315 transitions. [2024-11-09 02:16:48,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:16:48,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-09 02:16:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:48,362 INFO L225 Difference]: With dead ends: 216 [2024-11-09 02:16:48,362 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 02:16:48,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:16:48,366 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-09 02:16:48,367 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-09 02:16:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 02:16:48,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-11-09 02:16:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:16:48,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-09 02:16:48,381 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 131 [2024-11-09 02:16:48,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:48,382 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-09 02:16:48,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:16:48,382 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-09 02:16:48,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 02:16:48,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:48,384 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:48,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:16:48,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:48,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:48,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1991140457, now seen corresponding path program 1 times [2024-11-09 02:16:48,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:48,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589586184] [2024-11-09 02:16:48,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:48,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:16:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:16:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:16:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:16:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:16:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:16:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:16:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:16:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:16:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:16:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:48,932 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:16:48,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:48,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589586184] [2024-11-09 02:16:48,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589586184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:48,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:48,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:16:48,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630708037] [2024-11-09 02:16:48,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:48,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:16:48,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:48,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:16:48,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:16:48,938 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:16:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:49,252 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2024-11-09 02:16:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:16:49,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-09 02:16:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:49,254 INFO L225 Difference]: With dead ends: 219 [2024-11-09 02:16:49,254 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 02:16:49,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:16:49,256 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:49,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 493 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:16:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 02:16:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 02:16:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:16:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2024-11-09 02:16:49,264 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 131 [2024-11-09 02:16:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:49,264 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2024-11-09 02:16:49,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:16:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2024-11-09 02:16:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 02:16:49,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:49,266 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:49,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:16:49,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:49,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:49,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1568438631, now seen corresponding path program 1 times [2024-11-09 02:16:49,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:49,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468850090] [2024-11-09 02:16:49,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:49,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:16:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:16:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:16:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:16:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:16:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:16:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:16:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:16:51,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:16:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:16:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:16:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468850090] [2024-11-09 02:16:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468850090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:51,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:51,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:16:51,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597792243] [2024-11-09 02:16:51,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:52,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:16:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:16:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:16:52,002 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 02:16:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:52,966 INFO L93 Difference]: Finished difference Result 274 states and 394 transitions. [2024-11-09 02:16:52,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:16:52,967 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2024-11-09 02:16:52,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:52,968 INFO L225 Difference]: With dead ends: 274 [2024-11-09 02:16:52,969 INFO L226 Difference]: Without dead ends: 165 [2024-11-09 02:16:52,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:16:52,971 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 243 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:52,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 369 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:16:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-09 02:16:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2024-11-09 02:16:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:16:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2024-11-09 02:16:53,000 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 131 [2024-11-09 02:16:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:53,001 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2024-11-09 02:16:53,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 02:16:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2024-11-09 02:16:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 02:16:53,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:53,003 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:53,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:16:53,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:53,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:53,004 INFO L85 PathProgramCache]: Analyzing trace with hash -557321381, now seen corresponding path program 1 times [2024-11-09 02:16:53,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:53,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471044323] [2024-11-09 02:16:53,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:53,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:16:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:16:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:16:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:16:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:16:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:16:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:16:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:16:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:16:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:16:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:16:55,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:55,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471044323] [2024-11-09 02:16:55,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471044323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:55,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:55,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:16:55,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450195092] [2024-11-09 02:16:55,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:55,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:16:55,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:55,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:16:55,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:16:55,597 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 02:16:56,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:56,567 INFO L93 Difference]: Finished difference Result 319 states and 467 transitions. [2024-11-09 02:16:56,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:16:56,567 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2024-11-09 02:16:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:56,569 INFO L225 Difference]: With dead ends: 319 [2024-11-09 02:16:56,569 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 02:16:56,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:16:56,571 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 72 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:56,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 541 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:16:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 02:16:56,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2024-11-09 02:16:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 154 states have internal predecessors, (214), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 02:16:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 274 transitions. [2024-11-09 02:16:56,614 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 274 transitions. Word has length 131 [2024-11-09 02:16:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:56,615 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 274 transitions. [2024-11-09 02:16:56,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 02:16:56,615 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 274 transitions. [2024-11-09 02:16:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 02:16:56,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:56,618 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:56,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:16:56,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:56,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:56,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1833875789, now seen corresponding path program 1 times [2024-11-09 02:16:56,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:56,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366183564] [2024-11-09 02:16:56,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:16:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:16:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:16:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:16:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:16:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:16:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:16:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:16:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:16:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:16:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:16:58,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:58,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366183564] [2024-11-09 02:16:58,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366183564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:58,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:58,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:16:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942581987] [2024-11-09 02:16:58,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:58,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:16:58,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:58,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:16:58,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:16:58,698 INFO L87 Difference]: Start difference. First operand 187 states and 274 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 02:16:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:59,722 INFO L93 Difference]: Finished difference Result 354 states and 514 transitions. [2024-11-09 02:16:59,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:16:59,723 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2024-11-09 02:16:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:59,725 INFO L225 Difference]: With dead ends: 354 [2024-11-09 02:16:59,725 INFO L226 Difference]: Without dead ends: 231 [2024-11-09 02:16:59,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:16:59,726 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 242 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:59,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 364 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:16:59,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-09 02:16:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 190. [2024-11-09 02:16:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 157 states have (on average 1.3885350318471337) internal successors, (218), 157 states have internal predecessors, (218), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 02:16:59,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 278 transitions. [2024-11-09 02:16:59,756 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 278 transitions. Word has length 132 [2024-11-09 02:16:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:59,756 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 278 transitions. [2024-11-09 02:16:59,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 02:16:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 278 transitions. [2024-11-09 02:16:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 02:16:59,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:59,758 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:16:59,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:16:59,759 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:59,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:59,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1449974257, now seen corresponding path program 1 times [2024-11-09 02:16:59,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:59,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213391448] [2024-11-09 02:16:59,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:59,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:17:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:17:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:17:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:17:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:17:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:17:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:17:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:17:01,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:01,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213391448] [2024-11-09 02:17:01,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213391448] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:01,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:01,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:17:01,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404013859] [2024-11-09 02:17:01,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:01,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:17:01,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:01,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:17:01,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:17:01,631 INFO L87 Difference]: Start difference. First operand 190 states and 278 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 02:17:02,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:02,189 INFO L93 Difference]: Finished difference Result 323 states and 472 transitions. [2024-11-09 02:17:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:17:02,190 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 132 [2024-11-09 02:17:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:02,191 INFO L225 Difference]: With dead ends: 323 [2024-11-09 02:17:02,191 INFO L226 Difference]: Without dead ends: 197 [2024-11-09 02:17:02,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:17:02,193 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 119 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:02,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 413 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 02:17:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-09 02:17:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 190. [2024-11-09 02:17:02,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 157 states have (on average 1.3821656050955413) internal successors, (217), 157 states have internal predecessors, (217), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 02:17:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 277 transitions. [2024-11-09 02:17:02,212 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 277 transitions. Word has length 132 [2024-11-09 02:17:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:02,213 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 277 transitions. [2024-11-09 02:17:02,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-09 02:17:02,213 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 277 transitions. [2024-11-09 02:17:02,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 02:17:02,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:02,214 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:02,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:17:02,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:02,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:02,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1231119539, now seen corresponding path program 1 times [2024-11-09 02:17:02,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:02,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427148176] [2024-11-09 02:17:02,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:02,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:02,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:17:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:17:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:17:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:17:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:17:04,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:17:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:17:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:17:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:17:04,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:17:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:17:04,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:17:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:17:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 02:17:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 02:17:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:17:04,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:17:04,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427148176] [2024-11-09 02:17:04,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427148176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:04,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:04,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:17:04,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995075267] [2024-11-09 02:17:04,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:04,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:17:04,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:17:04,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:17:04,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:17:04,115 INFO L87 Difference]: Start difference. First operand 190 states and 277 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:17:04,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:04,831 INFO L93 Difference]: Finished difference Result 364 states and 526 transitions. [2024-11-09 02:17:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:17:04,832 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 132 [2024-11-09 02:17:04,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:04,834 INFO L225 Difference]: With dead ends: 364 [2024-11-09 02:17:04,834 INFO L226 Difference]: Without dead ends: 238 [2024-11-09 02:17:04,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:17:04,835 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 134 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:04,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 419 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:17:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-09 02:17:04,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 196. [2024-11-09 02:17:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 163 states have (on average 1.3742331288343559) internal successors, (224), 163 states have internal predecessors, (224), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 02:17:04,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 284 transitions. [2024-11-09 02:17:04,860 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 284 transitions. Word has length 132 [2024-11-09 02:17:04,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:04,861 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 284 transitions. [2024-11-09 02:17:04,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:17:04,861 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 284 transitions. [2024-11-09 02:17:04,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 02:17:04,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:04,863 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:04,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:17:04,863 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:04,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:04,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2042779403, now seen corresponding path program 1 times [2024-11-09 02:17:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:17:04,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70900576] [2024-11-09 02:17:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:04,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:17:05,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:17:05,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:17:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:17:05,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:17:05,183 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:17:05,184 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:17:05,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:17:05,187 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:05,348 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:17:05,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:17:05 BoogieIcfgContainer [2024-11-09 02:17:05,352 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:17:05,353 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:17:05,353 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:17:05,353 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:17:05,354 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:16:46" (3/4) ... [2024-11-09 02:17:05,356 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:17:05,357 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:17:05,358 INFO L158 Benchmark]: Toolchain (without parser) took 20400.53ms. Allocated memory was 174.1MB in the beginning and 671.1MB in the end (delta: 497.0MB). Free memory was 102.8MB in the beginning and 625.0MB in the end (delta: -522.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:17:05,358 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 174.1MB. Free memory was 130.3MB in the beginning and 130.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:17:05,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 478.80ms. Allocated memory is still 174.1MB. Free memory was 102.6MB in the beginning and 141.1MB in the end (delta: -38.5MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2024-11-09 02:17:05,359 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.83ms. Allocated memory is still 174.1MB. Free memory was 141.1MB in the beginning and 137.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:17:05,359 INFO L158 Benchmark]: Boogie Preprocessor took 99.95ms. Allocated memory is still 174.1MB. Free memory was 137.5MB in the beginning and 133.5MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:17:05,359 INFO L158 Benchmark]: RCFGBuilder took 832.01ms. Allocated memory is still 174.1MB. Free memory was 133.5MB in the beginning and 96.4MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-09 02:17:05,359 INFO L158 Benchmark]: TraceAbstraction took 18872.19ms. Allocated memory was 174.1MB in the beginning and 671.1MB in the end (delta: 497.0MB). Free memory was 95.7MB in the beginning and 625.0MB in the end (delta: -529.2MB). Peak memory consumption was 364.3MB. Max. memory is 16.1GB. [2024-11-09 02:17:05,360 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 671.1MB. Free memory is still 625.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:17:05,361 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.21ms. Allocated memory is still 174.1MB. Free memory was 130.3MB in the beginning and 130.1MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 478.80ms. Allocated memory is still 174.1MB. Free memory was 102.6MB in the beginning and 141.1MB in the end (delta: -38.5MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.83ms. Allocated memory is still 174.1MB. Free memory was 141.1MB in the beginning and 137.5MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.95ms. Allocated memory is still 174.1MB. Free memory was 137.5MB in the beginning and 133.5MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 832.01ms. Allocated memory is still 174.1MB. Free memory was 133.5MB in the beginning and 96.4MB in the end (delta: 37.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18872.19ms. Allocated memory was 174.1MB in the beginning and 671.1MB in the end (delta: 497.0MB). Free memory was 95.7MB in the beginning and 625.0MB in the end (delta: -529.2MB). Peak memory consumption was 364.3MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 671.1MB. Free memory is still 625.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryFLOATComparisonOperation at line 125, overapproximation of someUnaryDOUBLEoperation at line 42. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 5.5, 1, -0.41, 25, 100, 1, 15.75, 1.6, 0, 0, 16.5, 10, -10, -16 }; [L55] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L57] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L58] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L59] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L60] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L61] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L62] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L63] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L64] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L65] float* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] signed char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L67] signed char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L68] signed long int* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L69] float last_1_WrapperStruct00_var_1_12 = 15.75; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=0, last_1_WrapperStruct00_var_1_12=63/4] [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] CALL updateLastVariables() [L131] EXPR WrapperStruct00.var_1_12 [L131] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L141] RET updateLastVariables() [L142] CALL updateVariables() [L105] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L108] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F [L109] EXPR WrapperStruct00.var_1_7 [L109] EXPR WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] EXPR (WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L109] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L110] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L113] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L116] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L117] EXPR WrapperStruct00.var_1_13 [L117] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L117] EXPR WrapperStruct00.var_1_13 [L117] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L117] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L121] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_float() [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] EXPR (WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= 0.0F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L126] WrapperStruct00.var_1_18 = __VERIFIER_nondet_char() [L127] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L127] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L127] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L142] RET updateVariables() [L143] CALL step() [L73] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L73] COND FALSE !((*(WrapperStruct00_var_1_6_Pointer))) [L76] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L76] COND FALSE !(last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) [L80] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L80] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L81] COND FALSE !((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L92] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) [L94] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L94] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L94] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L94] signed long int stepLocal_0 = ((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))); [L95] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4, stepLocal_0=50] [L95] COND TRUE (*(WrapperStruct00_var_1_8_Pointer)) <= stepLocal_0 [L96] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L96] COND TRUE ! (*(WrapperStruct00_var_1_6_Pointer)) [L97] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L97] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L102] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L102] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L143] RET step() [L144] CALL, EXPR property() [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_19_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 [L134] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) [L134] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L134] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L134] EXPR (! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L134-L135] return ((((((*(WrapperStruct00_var_1_8_Pointer)) <= (((((*(WrapperStruct00_var_1_8_Pointer))) > (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : (((*(WrapperStruct00_var_1_8_Pointer)) + (*(WrapperStruct00_var_1_19_Pointer))))))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) > ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : ((last_1_WrapperStruct00_var_1_12 < (last_1_WrapperStruct00_var_1_12 + (*(WrapperStruct00_var_1_7_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (((((*(WrapperStruct00_var_1_9_Pointer))) < ((*(WrapperStruct00_var_1_10_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_10_Pointer))))))) : 1))) && (((*(WrapperStruct00_var_1_19_Pointer)) > (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : (((*(WrapperStruct00_var_1_14_Pointer)) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_16_Pointer))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_16_Pointer)))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((float) (*(WrapperStruct00_var_1_13_Pointer)))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_8_Pointer)))) ; [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_12_Pointer={4:20}, WrapperStruct00_var_1_13_Pointer={4:24}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_15_Pointer={4:29}, WrapperStruct00_var_1_16_Pointer={4:30}, WrapperStruct00_var_1_17_Pointer={4:34}, WrapperStruct00_var_1_18_Pointer={4:35}, WrapperStruct00_var_1_19_Pointer={4:36}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_6_Pointer={4:8}, WrapperStruct00_var_1_7_Pointer={4:9}, WrapperStruct00_var_1_8_Pointer={4:17}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_12=63/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.6s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 813 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 811 mSDsluCounter, 3650 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2572 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2690 IncrementalHoareTripleChecker+Invalid, 2783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 1078 mSDtfsCounter, 2690 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 403 GetRequests, 342 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=9, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 139 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 1310 NumberOfCodeBlocks, 1310 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1169 ConstructedInterpolants, 0 QuantifiedInterpolants, 9231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3780/3780 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 02:17:05,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:17:07,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:17:07,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:17:07,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:17:07,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:17:07,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:17:07,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:17:07,781 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:17:07,781 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:17:07,782 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:17:07,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:17:07,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:17:07,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:17:07,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:17:07,785 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:17:07,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:17:07,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:17:07,786 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:17:07,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:17:07,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:17:07,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:17:07,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:17:07,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:17:07,791 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:17:07,791 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:17:07,792 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:17:07,792 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:17:07,792 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:17:07,792 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:17:07,793 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:17:07,793 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:17:07,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:17:07,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:17:07,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:17:07,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:17:07,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:17:07,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:17:07,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:17:07,798 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:17:07,799 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:17:07,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:17:07,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:17:07,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:17:07,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:17:07,800 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0b6f0be1333f61e4454b9f149ce0c4a7b0aa6313f29f7394a725de312d0e6d9 [2024-11-09 02:17:08,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:17:08,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:17:08,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:17:08,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:17:08,179 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:17:08,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-09 02:17:09,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:17:09,891 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:17:09,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-09 02:17:09,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/279f53e86/47320da5941a4f08ba14a22dd33d2903/FLAGf1f6ebacb [2024-11-09 02:17:10,255 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/279f53e86/47320da5941a4f08ba14a22dd33d2903 [2024-11-09 02:17:10,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:17:10,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:17:10,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:17:10,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:17:10,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:17:10,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@753a4875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10, skipping insertion in model container [2024-11-09 02:17:10,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:17:10,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i[917,930] [2024-11-09 02:17:10,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:17:10,625 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:17:10,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-73.i[917,930] [2024-11-09 02:17:10,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:17:10,701 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:17:10,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10 WrapperNode [2024-11-09 02:17:10,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:17:10,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:17:10,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:17:10,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:17:10,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,774 INFO L138 Inliner]: procedures = 37, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2024-11-09 02:17:10,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:17:10,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:17:10,779 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:17:10,779 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:17:10,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,850 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2024-11-09 02:17:10,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,855 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:17:10,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:17:10,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:17:10,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:17:10,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (1/1) ... [2024-11-09 02:17:10,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:17:10,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:17:10,941 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-09 02:17:10,945 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-09 02:17:10,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:17:10,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 02:17:10,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 02:17:10,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-09 02:17:10,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-09 02:17:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 02:17:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 02:17:11,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:17:11,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:17:11,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:17:11,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:17:11,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 02:17:11,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 02:17:11,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 02:17:11,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 02:17:11,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-09 02:17:11,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-09 02:17:11,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 02:17:11,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 02:17:11,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:17:11,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:17:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:17:11,005 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:17:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 02:17:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 02:17:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:17:11,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:17:11,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:17:11,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:17:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 02:17:11,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 02:17:11,204 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:17:11,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:17:15,335 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-09 02:17:15,335 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:17:15,348 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:17:15,348 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:17:15,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:17:15 BoogieIcfgContainer [2024-11-09 02:17:15,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:17:15,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:17:15,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:17:15,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:17:15,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:17:10" (1/3) ... [2024-11-09 02:17:15,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6483e396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:17:15, skipping insertion in model container [2024-11-09 02:17:15,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:17:10" (2/3) ... [2024-11-09 02:17:15,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6483e396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:17:15, skipping insertion in model container [2024-11-09 02:17:15,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:17:15" (3/3) ... [2024-11-09 02:17:15,360 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-73.i [2024-11-09 02:17:15,377 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:17:15,377 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:17:15,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:17:15,446 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;@3446ebb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:17:15,446 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:17:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:17:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 02:17:15,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:15,468 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:15,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:15,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:15,474 INFO L85 PathProgramCache]: Analyzing trace with hash 2041388229, now seen corresponding path program 1 times [2024-11-09 02:17:15,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:17:15,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130219034] [2024-11-09 02:17:15,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:15,487 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-09 02:17:15,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:17:15,490 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-09 02:17:15,513 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-09 02:17:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:15,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:17:15,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:17:16,026 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-09 02:17:16,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:17:16,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:17:16,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130219034] [2024-11-09 02:17:16,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130219034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:16,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:16,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:17:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986755677] [2024-11-09 02:17:16,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:16,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:17:16,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:17:16,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:17:16,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:17:16,062 INFO L87 Difference]: Start difference. First operand has 110 states, 92 states have (on average 1.434782608695652) internal successors, (132), 93 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:17:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:16,095 INFO L93 Difference]: Finished difference Result 213 states and 333 transitions. [2024-11-09 02:17:16,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:17:16,099 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-09 02:17:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:16,106 INFO L225 Difference]: With dead ends: 213 [2024-11-09 02:17:16,106 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 02:17:16,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:17:16,113 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:16,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 02:17:16,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-09 02:17:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.404494382022472) internal successors, (125), 89 states have internal predecessors, (125), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:17:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-11-09 02:17:16,157 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 129 [2024-11-09 02:17:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:16,158 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-11-09 02:17:16,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:17:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-11-09 02:17:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 02:17:16,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:16,165 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:16,179 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 (2)] Forceful destruction successful, exit code 0 [2024-11-09 02:17:16,365 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-09 02:17:16,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:16,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:16,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1160715527, now seen corresponding path program 1 times [2024-11-09 02:17:16,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:17:16,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925161817] [2024-11-09 02:17:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:16,370 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-09 02:17:16,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:17:16,373 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-09 02:17:16,375 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-09 02:17:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:16,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:17:16,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:17:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2024-11-09 02:17:16,836 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:17:16,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:17:16,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925161817] [2024-11-09 02:17:16,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925161817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:16,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:16,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:17:16,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954694785] [2024-11-09 02:17:16,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:16,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:17:16,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:17:16,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:17:16,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:16,841 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:17:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:16,932 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2024-11-09 02:17:16,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:17:16,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-09 02:17:16,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:16,936 INFO L225 Difference]: With dead ends: 211 [2024-11-09 02:17:16,936 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 02:17:16,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:16,940 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:16,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:17:16,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 02:17:16,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 02:17:16,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 91 states have internal predecessors, (127), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:17:16,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2024-11-09 02:17:16,957 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 129 [2024-11-09 02:17:16,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:16,959 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2024-11-09 02:17:16,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:17:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2024-11-09 02:17:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 02:17:16,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:16,962 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:16,974 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-09 02:17:17,162 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-09 02:17:17,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:17,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:17,164 INFO L85 PathProgramCache]: Analyzing trace with hash 689359177, now seen corresponding path program 1 times [2024-11-09 02:17:17,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:17:17,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267721004] [2024-11-09 02:17:17,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:17,165 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-09 02:17:17,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:17:17,169 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-09 02:17:17,171 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-09 02:17:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:17,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 02:17:17,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:17:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:17:17,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:17:17,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:17:17,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267721004] [2024-11-09 02:17:17,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267721004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:17,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:17,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:17:17,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655424745] [2024-11-09 02:17:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:17,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:17:17,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:17:17,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:17:17,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:17,619 INFO L87 Difference]: Start difference. First operand 108 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:17:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:17,682 INFO L93 Difference]: Finished difference Result 215 states and 314 transitions. [2024-11-09 02:17:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:17:17,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 129 [2024-11-09 02:17:17,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:17,686 INFO L225 Difference]: With dead ends: 215 [2024-11-09 02:17:17,686 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 02:17:17,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:17,688 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:17,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:17:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 02:17:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-09 02:17:17,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:17:17,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-11-09 02:17:17,707 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 129 [2024-11-09 02:17:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:17,708 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-11-09 02:17:17,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:17:17,715 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-11-09 02:17:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 02:17:17,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:17,718 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:17,761 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-09 02:17:17,918 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-09 02:17:17,919 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:17,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:17,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1547220764, now seen corresponding path program 1 times [2024-11-09 02:17:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:17:17,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113049838] [2024-11-09 02:17:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:17,920 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-09 02:17:17,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:17:17,923 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-09 02:17:17,925 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-09 02:17:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:18,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:17:18,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:17:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:17:18,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:17:18,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:17:18,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113049838] [2024-11-09 02:17:18,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113049838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:18,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:18,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:17:18,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142048899] [2024-11-09 02:17:18,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:18,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:17:18,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:17:18,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:17:18,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:17:18,373 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:17:18,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:18,445 INFO L93 Difference]: Finished difference Result 222 states and 322 transitions. [2024-11-09 02:17:18,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:17:18,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2024-11-09 02:17:18,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:18,449 INFO L225 Difference]: With dead ends: 222 [2024-11-09 02:17:18,449 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 02:17:18,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:17:18,451 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:18,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 02:17:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 02:17:18,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-09 02:17:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:17:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-11-09 02:17:18,469 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 131 [2024-11-09 02:17:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:18,469 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-11-09 02:17:18,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:17:18,470 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-11-09 02:17:18,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 02:17:18,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:18,473 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:18,486 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-09 02:17:18,673 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-09 02:17:18,674 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:18,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:18,674 INFO L85 PathProgramCache]: Analyzing trace with hash 227786598, now seen corresponding path program 1 times [2024-11-09 02:17:18,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:17:18,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990268668] [2024-11-09 02:17:18,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:18,675 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-09 02:17:18,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:17:18,676 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-09 02:17:18,677 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-09 02:17:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:19,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:17:19,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:17:19,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-09 02:17:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2024-11-09 02:17:19,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:17:19,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:17:19,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990268668] [2024-11-09 02:17:19,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990268668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:19,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:19,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:17:19,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105364390] [2024-11-09 02:17:19,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:19,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:17:19,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:17:19,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:17:19,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:17:19,280 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:17:20,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:17:23,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:23,099 INFO L93 Difference]: Finished difference Result 226 states and 324 transitions. [2024-11-09 02:17:23,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:17:23,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2024-11-09 02:17:23,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:23,102 INFO L225 Difference]: With dead ends: 226 [2024-11-09 02:17:23,102 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 02:17:23,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:17:23,103 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 123 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:23,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 438 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 02:17:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 02:17:23,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-09 02:17:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:17:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-11-09 02:17:23,112 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 131 [2024-11-09 02:17:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:23,112 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-11-09 02:17:23,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:17:23,113 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-11-09 02:17:23,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 02:17:23,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:23,114 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:23,127 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-09 02:17:23,314 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-09 02:17:23,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:23,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1395501140, now seen corresponding path program 1 times [2024-11-09 02:17:23,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:17:23,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997281136] [2024-11-09 02:17:23,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:23,316 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-09 02:17:23,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:17:23,317 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-09 02:17:23,318 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-09 02:17:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:23,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 02:17:23,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:17:23,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-09 02:17:23,974 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-09 02:17:23,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:17:23,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:17:23,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997281136] [2024-11-09 02:17:23,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997281136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:23,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:23,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:17:23,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182007414] [2024-11-09 02:17:23,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:23,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:17:23,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:17:23,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:17:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:17:23,977 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:17:25,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:17:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:27,512 INFO L93 Difference]: Finished difference Result 226 states and 322 transitions. [2024-11-09 02:17:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:17:27,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2024-11-09 02:17:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:27,514 INFO L225 Difference]: With dead ends: 226 [2024-11-09 02:17:27,514 INFO L226 Difference]: Without dead ends: 115 [2024-11-09 02:17:27,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:17:27,515 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 102 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:27,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 434 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-09 02:17:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-09 02:17:27,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-09 02:17:27,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:17:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2024-11-09 02:17:27,531 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 133 [2024-11-09 02:17:27,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:27,532 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2024-11-09 02:17:27,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 02:17:27,532 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2024-11-09 02:17:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 02:17:27,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:27,533 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:27,545 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 (7)] Forceful destruction successful, exit code 0 [2024-11-09 02:17:27,734 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-09 02:17:27,734 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:27,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash 752811686, now seen corresponding path program 1 times [2024-11-09 02:17:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:17:27,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186720664] [2024-11-09 02:17:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:27,735 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-09 02:17:27,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:17:27,736 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-09 02:17:27,737 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-09 02:17:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:28,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 02:17:28,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:17:28,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 02:17:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:17:28,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:17:28,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:17:28,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186720664] [2024-11-09 02:17:28,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186720664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:28,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:28,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:17:28,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395923075] [2024-11-09 02:17:28,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:28,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:17:28,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:17:28,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:17:28,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:28,192 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:17:29,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:17:30,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:30,168 INFO L93 Difference]: Finished difference Result 227 states and 322 transitions. [2024-11-09 02:17:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:17:30,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-09 02:17:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:30,171 INFO L225 Difference]: With dead ends: 227 [2024-11-09 02:17:30,171 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 02:17:30,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:17:30,172 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:30,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 02:17:30,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 02:17:30,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 02:17:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:17:30,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2024-11-09 02:17:30,179 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 135 [2024-11-09 02:17:30,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:30,180 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2024-11-09 02:17:30,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:17:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2024-11-09 02:17:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 02:17:30,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:30,182 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:30,197 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-09 02:17:30,382 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-09 02:17:30,383 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:30,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:30,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1175513512, now seen corresponding path program 1 times [2024-11-09 02:17:30,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:17:30,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065753425] [2024-11-09 02:17:30,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:30,384 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-09 02:17:30,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:17:30,385 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-09 02:17:30,386 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-09 02:17:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:30,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 02:17:30,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:17:31,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:17:31,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 34 [2024-11-09 02:17:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 02:17:31,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:17:31,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:17:31,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065753425] [2024-11-09 02:17:31,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065753425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:17:31,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:17:31,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:17:31,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381453092] [2024-11-09 02:17:31,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:17:31,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:17:31,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:17:31,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:17:31,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:17:31,073 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:17:32,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 02:17:33,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 02:17:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:17:36,137 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2024-11-09 02:17:36,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:17:36,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2024-11-09 02:17:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:17:36,139 INFO L225 Difference]: With dead ends: 229 [2024-11-09 02:17:36,139 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 02:17:36,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:17:36,140 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:17:36,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-09 02:17:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 02:17:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2024-11-09 02:17:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 97 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 02:17:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-09 02:17:36,153 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 135 [2024-11-09 02:17:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:17:36,154 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-09 02:17:36,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 02:17:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-09 02:17:36,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 02:17:36,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:17:36,156 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:17:36,174 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 (9)] Forceful destruction successful, exit code 0 [2024-11-09 02:17:36,356 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-09 02:17:36,357 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:17:36,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:17:36,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1295579430, now seen corresponding path program 1 times [2024-11-09 02:17:36,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:17:36,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139000910] [2024-11-09 02:17:36,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:36,358 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-09 02:17:36,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:17:36,360 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-09 02:17:36,361 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-09 02:17:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:36,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 02:17:36,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:17:37,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:37,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:37,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:37,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:37,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:37,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:37,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:37,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:37,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:37,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:37,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 65 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 42 [2024-11-09 02:17:37,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-11-09 02:17:38,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2024-11-09 02:17:39,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-09 02:17:40,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-09 02:17:40,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-09 02:17:41,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-09 02:17:41,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 65 [2024-11-09 02:17:42,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 68 [2024-11-09 02:17:43,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-09 02:17:43,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 59 [2024-11-09 02:17:43,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2024-11-09 02:17:44,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:17:44,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 34 [2024-11-09 02:17:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 24 proven. 264 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2024-11-09 02:17:44,089 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:17:44,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:17:44,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139000910] [2024-11-09 02:17:44,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139000910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:17:44,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [876789200] [2024-11-09 02:17:44,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:17:44,506 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 02:17:44,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 02:17:44,507 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 02:17:44,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-09 02:17:46,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:17:46,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 02:17:46,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:17:46,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:17:46,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 76 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2024-11-09 02:17:46,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 79 [2024-11-09 02:17:47,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 87 [2024-11-09 02:17:50,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91 [2024-11-09 02:17:53,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 91 [2024-11-09 02:17:57,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 90