./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.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 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:06:04,392 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:06:04,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 09:06:04,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:06:04,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:06:04,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:06:04,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:06:04,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:06:04,503 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:06:04,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:06:04,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:06:04,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:06:04,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:06:04,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:06:04,508 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:06:04,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:06:04,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:06:04,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:06:04,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 09:06:04,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:06:04,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:06:04,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:06:04,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:06:04,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:06:04,515 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:06:04,515 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:06:04,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:06:04,516 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:06:04,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:06:04,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:06:04,517 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:06:04,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:06:04,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:06:04,517 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:06:04,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:06:04,518 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:06:04,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 09:06:04,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 09:06:04,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:06:04,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:06:04,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:06:04,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:06:04,521 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 -> 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e [2024-11-20 09:06:04,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:06:04,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:06:04,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:06:04,816 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:06:04,816 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:06:04,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-20 09:06:06,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:06:06,468 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:06:06,469 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-20 09:06:06,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebd65efe/84db7663bb604dff8a238b7c28c6ddb4/FLAG7b7aeb505 [2024-11-20 09:06:06,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebd65efe/84db7663bb604dff8a238b7c28c6ddb4 [2024-11-20 09:06:06,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:06:06,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:06:06,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:06:06,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:06:06,509 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:06:06,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:06,510 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2509e278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06, skipping insertion in model container [2024-11-20 09:06:06,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:06,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:06:06,726 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-31.i[917,930] [2024-11-20 09:06:06,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:06:06,821 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:06:06,832 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-31.i[917,930] [2024-11-20 09:06:06,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:06:06,882 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:06:06,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06 WrapperNode [2024-11-20 09:06:06,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:06:06,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:06:06,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:06:06,885 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:06:06,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:06,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:06,946 INFO L138 Inliner]: procedures = 30, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 421 [2024-11-20 09:06:06,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:06:06,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:06:06,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:06:06,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:06:06,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:06,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:07,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:07,016 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 09:06:07,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:07,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:07,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:07,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:07,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:07,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:07,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:06:07,059 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:06:07,059 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:06:07,059 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:06:07,060 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (1/1) ... [2024-11-20 09:06:07,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:06:07,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:06:07,103 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-20 09:06:07,108 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-20 09:06:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:06:07,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-20 09:06:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-20 09:06:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-20 09:06:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 09:06:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-20 09:06:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 09:06:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:06:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:06:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 09:06:07,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:06:07,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:06:07,310 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:06:07,312 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:06:07,840 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-20 09:06:07,840 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:06:07,858 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:06:07,859 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:06:07,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:06:07 BoogieIcfgContainer [2024-11-20 09:06:07,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:06:07,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:06:07,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:06:07,868 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:06:07,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:06:06" (1/3) ... [2024-11-20 09:06:07,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362aa857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:06:07, skipping insertion in model container [2024-11-20 09:06:07,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:06" (2/3) ... [2024-11-20 09:06:07,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362aa857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:06:07, skipping insertion in model container [2024-11-20 09:06:07,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:06:07" (3/3) ... [2024-11-20 09:06:07,872 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-20 09:06:07,887 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:06:07,887 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:06:07,946 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:06:07,952 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;@523f684b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:06:07,953 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:06:07,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 09:06:07,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:07,967 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:07,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:07,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -686948204, now seen corresponding path program 1 times [2024-11-20 09:06:07,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:07,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613429463] [2024-11-20 09:06:07,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:07,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:08,435 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:08,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:08,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613429463] [2024-11-20 09:06:08,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613429463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:08,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:08,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:06:08,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070702792] [2024-11-20 09:06:08,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:08,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:06:08,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:08,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:06:08,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:06:08,475 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:06:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:08,498 INFO L93 Difference]: Finished difference Result 167 states and 261 transitions. [2024-11-20 09:06:08,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:06:08,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-20 09:06:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:08,527 INFO L225 Difference]: With dead ends: 167 [2024-11-20 09:06:08,527 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 09:06:08,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-20 09:06:08,542 INFO L432 NwaCegarLoop]: 121 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, 121 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-20 09:06:08,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:06:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 09:06:08,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-20 09:06:08,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2024-11-20 09:06:08,605 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 94 [2024-11-20 09:06:08,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:08,607 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2024-11-20 09:06:08,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:06:08,608 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2024-11-20 09:06:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 09:06:08,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:08,612 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:08,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 09:06:08,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:08,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:08,613 INFO L85 PathProgramCache]: Analyzing trace with hash 862036710, now seen corresponding path program 1 times [2024-11-20 09:06:08,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:08,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200034987] [2024-11-20 09:06:08,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:08,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:09,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:09,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200034987] [2024-11-20 09:06:09,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200034987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:09,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:09,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:06:09,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664638570] [2024-11-20 09:06:09,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:09,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:06:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:09,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:06:09,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:06:09,187 INFO L87 Difference]: Start difference. First operand 83 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:09,373 INFO L93 Difference]: Finished difference Result 163 states and 239 transitions. [2024-11-20 09:06:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:06:09,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-20 09:06:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:09,379 INFO L225 Difference]: With dead ends: 163 [2024-11-20 09:06:09,379 INFO L226 Difference]: Without dead ends: 83 [2024-11-20 09:06:09,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:06:09,381 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:09,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:06:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-20 09:06:09,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-20 09:06:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2024-11-20 09:06:09,404 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 94 [2024-11-20 09:06:09,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:09,408 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2024-11-20 09:06:09,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:09,409 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2024-11-20 09:06:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 09:06:09,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:09,415 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:09,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 09:06:09,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:09,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:09,416 INFO L85 PathProgramCache]: Analyzing trace with hash -726311192, now seen corresponding path program 1 times [2024-11-20 09:06:09,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:09,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197625409] [2024-11-20 09:06:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:09,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:11,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:11,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:11,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:12,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197625409] [2024-11-20 09:06:12,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197625409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:12,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:12,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 09:06:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496261882] [2024-11-20 09:06:12,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:12,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 09:06:12,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:12,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 09:06:12,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-20 09:06:12,105 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:06:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:12,758 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2024-11-20 09:06:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:06:12,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-20 09:06:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:12,760 INFO L225 Difference]: With dead ends: 199 [2024-11-20 09:06:12,760 INFO L226 Difference]: Without dead ends: 119 [2024-11-20 09:06:12,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-20 09:06:12,762 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 312 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:12,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 290 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:06:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-20 09:06:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 87. [2024-11-20 09:06:12,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2024-11-20 09:06:12,777 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 94 [2024-11-20 09:06:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:12,778 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2024-11-20 09:06:12,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:06:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2024-11-20 09:06:12,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 09:06:12,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:12,780 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:12,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 09:06:12,780 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:12,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:12,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1593160989, now seen corresponding path program 1 times [2024-11-20 09:06:12,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:12,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167414060] [2024-11-20 09:06:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:12,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:12,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:13,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:13,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167414060] [2024-11-20 09:06:13,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167414060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:13,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:13,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:06:13,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573574515] [2024-11-20 09:06:13,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:13,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:06:13,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:13,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:06:13,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:06:13,032 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:13,050 INFO L93 Difference]: Finished difference Result 171 states and 247 transitions. [2024-11-20 09:06:13,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:06:13,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-20 09:06:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:13,052 INFO L225 Difference]: With dead ends: 171 [2024-11-20 09:06:13,052 INFO L226 Difference]: Without dead ends: 87 [2024-11-20 09:06:13,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:06:13,055 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:13,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:06:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-20 09:06:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-20 09:06:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 74 states have internal predecessors, (102), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 124 transitions. [2024-11-20 09:06:13,076 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 124 transitions. Word has length 96 [2024-11-20 09:06:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:13,077 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 124 transitions. [2024-11-20 09:06:13,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 124 transitions. [2024-11-20 09:06:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 09:06:13,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:13,081 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:13,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 09:06:13,082 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:13,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:13,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1986187999, now seen corresponding path program 1 times [2024-11-20 09:06:13,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:13,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054326162] [2024-11-20 09:06:13,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:15,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:15,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054326162] [2024-11-20 09:06:15,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054326162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:15,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:15,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 09:06:15,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357807362] [2024-11-20 09:06:15,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:15,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:06:15,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:15,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:06:15,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:06:15,759 INFO L87 Difference]: Start difference. First operand 87 states and 124 transitions. Second operand has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 09:06:16,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:16,663 INFO L93 Difference]: Finished difference Result 175 states and 250 transitions. [2024-11-20 09:06:16,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:06:16,664 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2024-11-20 09:06:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:16,665 INFO L225 Difference]: With dead ends: 175 [2024-11-20 09:06:16,665 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 09:06:16,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-20 09:06:16,666 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 282 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:16,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 327 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:06:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 09:06:16,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-11-20 09:06:16,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.368421052631579) internal successors, (104), 76 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:16,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-20 09:06:16,683 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 96 [2024-11-20 09:06:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:16,684 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-20 09:06:16,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.0) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 09:06:16,684 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-20 09:06:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 09:06:16,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:16,686 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:16,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 09:06:16,686 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:16,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:16,689 INFO L85 PathProgramCache]: Analyzing trace with hash 798189168, now seen corresponding path program 1 times [2024-11-20 09:06:16,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:16,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803368269] [2024-11-20 09:06:16,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:16,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:17,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:17,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:17,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803368269] [2024-11-20 09:06:17,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803368269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:17,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:17,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:06:17,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279587749] [2024-11-20 09:06:17,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:17,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:06:17,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:17,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:06:17,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:06:17,117 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:17,429 INFO L93 Difference]: Finished difference Result 209 states and 295 transitions. [2024-11-20 09:06:17,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:06:17,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-20 09:06:17,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:17,435 INFO L225 Difference]: With dead ends: 209 [2024-11-20 09:06:17,436 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 09:06:17,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:06:17,437 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 126 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:17,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 441 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 09:06:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 09:06:17,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 89. [2024-11-20 09:06:17,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:17,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 125 transitions. [2024-11-20 09:06:17,458 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 125 transitions. Word has length 96 [2024-11-20 09:06:17,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:17,458 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 125 transitions. [2024-11-20 09:06:17,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:17,459 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 125 transitions. [2024-11-20 09:06:17,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 09:06:17,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:17,463 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:17,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 09:06:17,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:17,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:17,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1477097076, now seen corresponding path program 1 times [2024-11-20 09:06:17,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:17,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196690656] [2024-11-20 09:06:17,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:17,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:17,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:17,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196690656] [2024-11-20 09:06:17,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196690656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:17,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:17,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:06:17,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138532169] [2024-11-20 09:06:17,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:17,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:06:17,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:17,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:06:17,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:06:17,642 INFO L87 Difference]: Start difference. First operand 89 states and 125 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:17,696 INFO L93 Difference]: Finished difference Result 178 states and 251 transitions. [2024-11-20 09:06:17,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 09:06:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2024-11-20 09:06:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:17,698 INFO L225 Difference]: With dead ends: 178 [2024-11-20 09:06:17,698 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 09:06:17,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-20 09:06:17,701 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:17,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:06:17,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 09:06:17,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2024-11-20 09:06:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:17,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2024-11-20 09:06:17,720 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 97 [2024-11-20 09:06:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:17,720 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2024-11-20 09:06:17,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2024-11-20 09:06:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 09:06:17,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:17,721 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:17,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 09:06:17,722 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:17,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:17,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1218931638, now seen corresponding path program 1 times [2024-11-20 09:06:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:17,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239893325] [2024-11-20 09:06:17,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:17,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:19,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:19,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239893325] [2024-11-20 09:06:19,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239893325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:19,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:19,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 09:06:19,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097557488] [2024-11-20 09:06:19,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:19,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 09:06:19,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:19,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 09:06:19,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-20 09:06:19,321 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 09:06:19,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:19,918 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2024-11-20 09:06:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 09:06:19,919 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2024-11-20 09:06:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:19,921 INFO L225 Difference]: With dead ends: 206 [2024-11-20 09:06:19,923 INFO L226 Difference]: Without dead ends: 119 [2024-11-20 09:06:19,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2024-11-20 09:06:19,924 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 390 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:19,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 266 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 09:06:19,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-20 09:06:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2024-11-20 09:06:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2024-11-20 09:06:19,945 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 97 [2024-11-20 09:06:19,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:19,945 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2024-11-20 09:06:19,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 09:06:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2024-11-20 09:06:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 09:06:19,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:19,947 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:19,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 09:06:19,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:19,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:19,947 INFO L85 PathProgramCache]: Analyzing trace with hash 721006156, now seen corresponding path program 1 times [2024-11-20 09:06:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876244224] [2024-11-20 09:06:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:19,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:22,513 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:22,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:22,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876244224] [2024-11-20 09:06:22,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876244224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:22,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:22,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 09:06:22,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754651146] [2024-11-20 09:06:22,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:22,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 09:06:22,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:22,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 09:06:22,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-20 09:06:22,516 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 09:06:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:24,388 INFO L93 Difference]: Finished difference Result 264 states and 363 transitions. [2024-11-20 09:06:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 09:06:24,390 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2024-11-20 09:06:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:24,392 INFO L225 Difference]: With dead ends: 264 [2024-11-20 09:06:24,392 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 09:06:24,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2024-11-20 09:06:24,393 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 534 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:24,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 494 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 09:06:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 09:06:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2024-11-20 09:06:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 110 states have (on average 1.3454545454545455) internal successors, (148), 110 states have internal predecessors, (148), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2024-11-20 09:06:24,424 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 98 [2024-11-20 09:06:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:24,425 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2024-11-20 09:06:24,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 09:06:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2024-11-20 09:06:24,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 09:06:24,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:24,427 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:24,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 09:06:24,428 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:24,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:24,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1669998802, now seen corresponding path program 1 times [2024-11-20 09:06:24,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:24,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975617037] [2024-11-20 09:06:24,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:24,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:24,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:24,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:24,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975617037] [2024-11-20 09:06:24,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975617037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:24,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:24,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 09:06:24,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986027317] [2024-11-20 09:06:24,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:24,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 09:06:24,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:24,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 09:06:24,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 09:06:24,773 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:25,058 INFO L93 Difference]: Finished difference Result 302 states and 411 transitions. [2024-11-20 09:06:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 09:06:25,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-20 09:06:25,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:25,059 INFO L225 Difference]: With dead ends: 302 [2024-11-20 09:06:25,059 INFO L226 Difference]: Without dead ends: 182 [2024-11-20 09:06:25,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-20 09:06:25,061 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 127 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:25,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 541 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 09:06:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-20 09:06:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 131. [2024-11-20 09:06:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 118 states have internal predecessors, (160), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2024-11-20 09:06:25,075 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 99 [2024-11-20 09:06:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:25,076 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2024-11-20 09:06:25,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:25,076 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2024-11-20 09:06:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 09:06:25,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:25,077 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:25,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 09:06:25,078 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:25,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:25,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1603900140, now seen corresponding path program 1 times [2024-11-20 09:06:25,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:25,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387663542] [2024-11-20 09:06:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:25,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387663542] [2024-11-20 09:06:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387663542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:25,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 09:06:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519185915] [2024-11-20 09:06:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:25,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 09:06:25,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 09:06:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-20 09:06:25,894 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 09:06:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:26,418 INFO L93 Difference]: Finished difference Result 314 states and 435 transitions. [2024-11-20 09:06:26,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 09:06:26,419 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2024-11-20 09:06:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:26,420 INFO L225 Difference]: With dead ends: 314 [2024-11-20 09:06:26,420 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 09:06:26,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-20 09:06:26,421 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 213 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:26,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 402 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 09:06:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 09:06:26,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 141. [2024-11-20 09:06:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.359375) internal successors, (174), 128 states have internal predecessors, (174), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 196 transitions. [2024-11-20 09:06:26,442 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 196 transitions. Word has length 99 [2024-11-20 09:06:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:26,442 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 196 transitions. [2024-11-20 09:06:26,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-20 09:06:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 196 transitions. [2024-11-20 09:06:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 09:06:26,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:26,444 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:26,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 09:06:26,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:26,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash 15552238, now seen corresponding path program 1 times [2024-11-20 09:06:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521019789] [2024-11-20 09:06:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:26,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:26,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:26,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521019789] [2024-11-20 09:06:26,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521019789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:26,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:26,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:06:26,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868861926] [2024-11-20 09:06:26,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:26,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 09:06:26,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:26,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 09:06:26,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 09:06:26,662 INFO L87 Difference]: Start difference. First operand 141 states and 196 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:26,799 INFO L93 Difference]: Finished difference Result 312 states and 425 transitions. [2024-11-20 09:06:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:06:26,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2024-11-20 09:06:26,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:26,801 INFO L225 Difference]: With dead ends: 312 [2024-11-20 09:06:26,802 INFO L226 Difference]: Without dead ends: 174 [2024-11-20 09:06:26,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:06:26,803 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 84 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:26,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 336 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:06:26,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-20 09:06:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 129. [2024-11-20 09:06:26,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 116 states have internal predecessors, (154), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 176 transitions. [2024-11-20 09:06:26,819 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 176 transitions. Word has length 99 [2024-11-20 09:06:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:26,820 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 176 transitions. [2024-11-20 09:06:26,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 176 transitions. [2024-11-20 09:06:26,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-20 09:06:26,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:26,821 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:26,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 09:06:26,822 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:26,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:26,822 INFO L85 PathProgramCache]: Analyzing trace with hash -949172821, now seen corresponding path program 1 times [2024-11-20 09:06:26,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:26,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930695389] [2024-11-20 09:06:26,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:26,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 09:06:26,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629060217] [2024-11-20 09:06:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:26,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:06:26,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:06:26,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:06:26,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 09:06:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:27,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-20 09:06:27,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:06:27,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2024-11-20 09:06:27,552 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 56 treesize of output 46 [2024-11-20 09:06:28,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 09:06:28,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 09:06:29,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 09:06:29,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 09:06:30,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 09:06:30,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-20 09:06:30,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:06:30,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:06:30,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2024-11-20 09:06:30,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:06:30,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:06:30,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:06:30,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:06:30,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 43 [2024-11-20 09:06:31,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:06:31,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:06:31,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 09:06:31,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 09:06:31,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 24 [2024-11-20 09:06:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 69 proven. 61 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-20 09:06:31,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 09:06:40,081 WARN L851 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_9_Pointer~0.base Int) (v_ArrVal_991 (Array Int Int)) (|v_ULTIMATE.start_property_#t~mem82#1_10| Int)) (let ((.cse0 (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_991))) (store .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (+ (* (- 2) (mod (select (select .cse1 ~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256)) (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset))))))) (or (< (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_property_#t~mem82#1_10|) (+ (select (select .cse0 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 1)) (< (select (select .cse0 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) |v_ULTIMATE.start_property_#t~mem82#1_10|) (not (= v_ArrVal_991 (store (select |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_991 c_~WrapperStruct00_var_1_13_Pointer~0.offset))))))) is different from false [2024-11-20 09:06:40,164 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_990 Int) (~WrapperStruct00_var_1_9_Pointer~0.base Int) (v_ArrVal_991 (Array Int Int)) (|v_ULTIMATE.start_property_#t~mem82#1_10| Int)) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_990)))) (let ((.cse1 (let ((.cse2 (store .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_991))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (+ (select (select .cse2 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) (* (- 2) (mod (select (select .cse2 ~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256)))))))) (or (not (= v_ArrVal_991 (store (select .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_991 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))) (< (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_property_#t~mem82#1_10|) (+ (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 1)) (< (select (select .cse1 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) |v_ULTIMATE.start_property_#t~mem82#1_10|))))) is different from false [2024-11-20 09:06:40,343 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_step_#t~mem4#1_10| Int)) (or (< |v_ULTIMATE.start_step_#t~mem4#1_10| (select (select |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset)) (< (select (select |c_#memory_int| c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_step_#t~mem4#1_10|)))) (forall ((v_ArrVal_990 Int) (~WrapperStruct00_var_1_9_Pointer~0.base Int) (v_ArrVal_991 (Array Int Int)) (|v_ULTIMATE.start_property_#t~mem82#1_10| Int)) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_7_Pointer~0.base) c_~WrapperStruct00_var_1_7_Pointer~0.offset v_ArrVal_990)))) (let ((.cse1 (let ((.cse2 (store .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_991))) (store .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset (+ (select (select .cse2 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) (* (- 2) (mod (select (select .cse2 ~WrapperStruct00_var_1_9_Pointer~0.base) c_~WrapperStruct00_var_1_9_Pointer~0.offset) 256)))))))) (or (not (= v_ArrVal_991 (store (select .cse0 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_991 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))) (< (* c_~last_1_WrapperStruct00_var_1_7~0 |v_ULTIMATE.start_property_#t~mem82#1_10|) (+ (select (select .cse1 c_~WrapperStruct00_var_1_3_Pointer~0.base) c_~WrapperStruct00_var_1_3_Pointer~0.offset) 1)) (< (select (select .cse1 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset) |v_ULTIMATE.start_property_#t~mem82#1_10|)))))) is different from false [2024-11-20 09:06:40,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:40,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930695389] [2024-11-20 09:06:40,458 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 09:06:40,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629060217] [2024-11-20 09:06:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629060217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 09:06:40,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 09:06:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-20 09:06:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178207628] [2024-11-20 09:06:40,459 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 09:06:40,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 09:06:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:40,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 09:06:40,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=289, Unknown=4, NotChecked=108, Total=462 [2024-11-20 09:06:40,461 INFO L87 Difference]: Start difference. First operand 129 states and 176 transitions. Second operand has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-20 09:06:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:42,422 INFO L93 Difference]: Finished difference Result 483 states and 650 transitions. [2024-11-20 09:06:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 09:06:42,422 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 99 [2024-11-20 09:06:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:42,424 INFO L225 Difference]: With dead ends: 483 [2024-11-20 09:06:42,424 INFO L226 Difference]: Without dead ends: 357 [2024-11-20 09:06:42,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=216, Invalid=784, Unknown=4, NotChecked=186, Total=1190 [2024-11-20 09:06:42,427 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 447 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:42,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 733 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 09:06:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-20 09:06:42,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 207. [2024-11-20 09:06:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 180 states have (on average 1.3055555555555556) internal successors, (235), 180 states have internal predecessors, (235), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 09:06:42,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 279 transitions. [2024-11-20 09:06:42,465 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 279 transitions. Word has length 99 [2024-11-20 09:06:42,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:42,466 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 279 transitions. [2024-11-20 09:06:42,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 4 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-20 09:06:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 279 transitions. [2024-11-20 09:06:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 09:06:42,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:42,467 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:42,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 09:06:42,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-20 09:06:42,669 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:42,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:42,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1418951654, now seen corresponding path program 1 times [2024-11-20 09:06:42,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:42,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814100408] [2024-11-20 09:06:42,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:42,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 09:06:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 09:06:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 09:06:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 09:06:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 09:06:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 09:06:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-20 09:06:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-20 09:06:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 09:06:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 09:06:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 09:06:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:42,891 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 09:06:42,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814100408] [2024-11-20 09:06:42,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814100408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:42,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:42,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 09:06:42,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503387823] [2024-11-20 09:06:42,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:42,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:06:42,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 09:06:42,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:06:42,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:06:42,894 INFO L87 Difference]: Start difference. First operand 207 states and 279 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:42,954 INFO L93 Difference]: Finished difference Result 337 states and 457 transitions. [2024-11-20 09:06:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:06:42,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2024-11-20 09:06:42,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:42,956 INFO L225 Difference]: With dead ends: 337 [2024-11-20 09:06:42,956 INFO L226 Difference]: Without dead ends: 211 [2024-11-20 09:06:42,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:06:42,957 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:42,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:06:42,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-20 09:06:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2024-11-20 09:06:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.3038674033149171) internal successors, (236), 181 states have internal predecessors, (236), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 09:06:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 280 transitions. [2024-11-20 09:06:42,989 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 280 transitions. Word has length 100 [2024-11-20 09:06:42,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:42,990 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 280 transitions. [2024-11-20 09:06:42,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:42,990 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 280 transitions. [2024-11-20 09:06:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-20 09:06:42,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:42,991 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:42,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 09:06:42,991 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:42,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:42,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1251915825, now seen corresponding path program 1 times [2024-11-20 09:06:42,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 09:06:42,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864463085] [2024-11-20 09:06:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:42,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 09:06:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 09:06:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [873918010] [2024-11-20 09:06:43,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:43,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 09:06:43,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:06:43,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 09:06:43,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 09:06:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:06:43,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 09:06:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 09:06:43,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 09:06:43,927 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 09:06:43,929 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 09:06:43,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 09:06:44,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-20 09:06:44,135 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 09:06:44,260 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 09:06:44,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 09:06:44 BoogieIcfgContainer [2024-11-20 09:06:44,263 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 09:06:44,264 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 09:06:44,264 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 09:06:44,264 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 09:06:44,268 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:06:07" (3/4) ... [2024-11-20 09:06:44,272 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 09:06:44,273 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 09:06:44,274 INFO L158 Benchmark]: Toolchain (without parser) took 37774.14ms. Allocated memory was 134.2MB in the beginning and 597.7MB in the end (delta: 463.5MB). Free memory was 79.6MB in the beginning and 352.5MB in the end (delta: -272.9MB). Peak memory consumption was 191.3MB. Max. memory is 16.1GB. [2024-11-20 09:06:44,274 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 134.2MB. Free memory is still 107.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:06:44,275 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.67ms. Allocated memory is still 134.2MB. Free memory was 79.4MB in the beginning and 63.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 09:06:44,275 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.10ms. Allocated memory is still 134.2MB. Free memory was 63.2MB in the beginning and 59.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 09:06:44,275 INFO L158 Benchmark]: Boogie Preprocessor took 108.30ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 59.8MB in the beginning and 134.0MB in the end (delta: -74.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-11-20 09:06:44,276 INFO L158 Benchmark]: RCFGBuilder took 800.44ms. Allocated memory is still 163.6MB. Free memory was 134.0MB in the beginning and 102.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-20 09:06:44,276 INFO L158 Benchmark]: TraceAbstraction took 36399.22ms. Allocated memory was 163.6MB in the beginning and 597.7MB in the end (delta: 434.1MB). Free memory was 101.6MB in the beginning and 353.6MB in the end (delta: -252.0MB). Peak memory consumption was 183.0MB. Max. memory is 16.1GB. [2024-11-20 09:06:44,277 INFO L158 Benchmark]: Witness Printer took 9.78ms. Allocated memory is still 597.7MB. Free memory was 353.6MB in the beginning and 352.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 09:06:44,279 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.70ms. Allocated memory is still 134.2MB. Free memory is still 107.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.67ms. Allocated memory is still 134.2MB. Free memory was 79.4MB in the beginning and 63.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.10ms. Allocated memory is still 134.2MB. Free memory was 63.2MB in the beginning and 59.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 108.30ms. Allocated memory was 134.2MB in the beginning and 163.6MB in the end (delta: 29.4MB). Free memory was 59.8MB in the beginning and 134.0MB in the end (delta: -74.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * RCFGBuilder took 800.44ms. Allocated memory is still 163.6MB. Free memory was 134.0MB in the beginning and 102.6MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 36399.22ms. Allocated memory was 163.6MB in the beginning and 597.7MB in the end (delta: 434.1MB). Free memory was 101.6MB in the beginning and 353.6MB in the end (delta: -252.0MB). Peak memory consumption was 183.0MB. Max. memory is 16.1GB. * Witness Printer took 9.78ms. Allocated memory is still 597.7MB. Free memory was 353.6MB in the beginning and 352.5MB in the end (delta: 1.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 121. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 200, 0, 1107940323, 0, 4, -32, 64, 4, 0.97, 32.6 }; [L47] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L49] signed long int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L50] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L51] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L52] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L53] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L54] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L55] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L56] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L57] signed long int last_1_WrapperStruct00_var_1_7 = 4; [L58] double last_1_WrapperStruct00_var_1_13 = 0.97; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=0, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L117] EXPR WrapperStruct00.var_1_7 [L117] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_13 [L118] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L98] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L101] WrapperStruct00.var_1_3 = __VERIFIER_nondet_long() [L102] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 1073741822) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 2147483646) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L104] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L107] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L108] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L110] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L113] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_14 [L114] EXPR WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_14 [L114] EXPR WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L129] RET updateVariables() [L130] CALL step() [L62] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L62] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L62] COND FALSE !(! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) [L69] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L69] (*(WrapperStruct00_var_1_9_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L71] COND FALSE !((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) [L74] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L74] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L74] (*(WrapperStruct00_var_1_7_Pointer)) = ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))) [L76] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L76] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L76] COND FALSE !(((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) [L87] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L87] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_14_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L89] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) [L90] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L90] (*(WrapperStruct00_var_1_1_Pointer)) = (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer)))))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR (! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR (((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L121] EXPR (((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L121-L122] return ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_9_Pointer))) - (*(WrapperStruct00_var_1_9_Pointer))))) : (((*(WrapperStruct00_var_1_6_Pointer)) && ((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer)))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_3_Pointer)))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) < (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_9_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_9_Pointer)) - (*(WrapperStruct00_var_1_3_Pointer))))))) && ((! ((*(WrapperStruct00_var_1_3_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) * last_1_WrapperStruct00_var_1_7))) ? ((((((last_1_WrapperStruct00_var_1_13) < 0 ) ? -(last_1_WrapperStruct00_var_1_13) : (last_1_WrapperStruct00_var_1_13))) < last_1_WrapperStruct00_var_1_13) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))) : 1) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_12_Pointer)))))) && ((((*(WrapperStruct00_var_1_9_Pointer)) + (*(WrapperStruct00_var_1_3_Pointer))) < (*(WrapperStruct00_var_1_9_Pointer))) ? (((*(WrapperStruct00_var_1_2_Pointer)) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) 0.8)) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((double) (*(WrapperStruct00_var_1_14_Pointer))))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_12_Pointer={4:19}, WrapperStruct00_var_1_13_Pointer={4:20}, WrapperStruct00_var_1_14_Pointer={4:28}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:4}, WrapperStruct00_var_1_3_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:14}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1, last_1_WrapperStruct00_var_1_13=97/100, last_1_WrapperStruct00_var_1_7=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.2s, OverallIterations: 15, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2521 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2515 mSDsluCounter, 5384 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3934 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4018 IncrementalHoareTripleChecker+Invalid, 4196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 1450 mSDtfsCounter, 4018 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 583 GetRequests, 445 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=14, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 447 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 25.1s InterpolantComputationTime, 1657 NumberOfCodeBlocks, 1657 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1344 ConstructedInterpolants, 8 QuantifiedInterpolants, 15267 SizeOfPredicates, 17 NumberOfNonLiveVariables, 426 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 3019/3080 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-20 09:06:44,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.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 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 09:06:46,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 09:06:46,573 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 09:06:46,581 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 09:06:46,582 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 09:06:46,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 09:06:46,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 09:06:46,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 09:06:46,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 09:06:46,621 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 09:06:46,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 09:06:46,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 09:06:46,622 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 09:06:46,622 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 09:06:46,623 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 09:06:46,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 09:06:46,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 09:06:46,626 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 09:06:46,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 09:06:46,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 09:06:46,629 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 09:06:46,629 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 09:06:46,629 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 09:06:46,631 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 09:06:46,631 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 09:06:46,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 09:06:46,632 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 09:06:46,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 09:06:46,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 09:06:46,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 09:06:46,633 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 09:06:46,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 09:06:46,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 09:06:46,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 09:06:46,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:06:46,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 09:06:46,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 09:06:46,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 09:06:46,642 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 09:06:46,642 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 09:06:46,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 09:06:46,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 09:06:46,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 09:06:46,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 09:06:46,646 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 -> 367be7c22167f0070184c1037e3b882430c4c396bd667e7af2dd299892b7190e [2024-11-20 09:06:46,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 09:06:47,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 09:06:47,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 09:06:47,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 09:06:47,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 09:06:47,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-20 09:06:48,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 09:06:48,755 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 09:06:48,755 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-20 09:06:48,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc77dfd1e/dab3b17cdcd14a66b65d395576709b3e/FLAGdb659272a [2024-11-20 09:06:48,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc77dfd1e/dab3b17cdcd14a66b65d395576709b3e [2024-11-20 09:06:48,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 09:06:48,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 09:06:48,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 09:06:48,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 09:06:48,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 09:06:48,804 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:06:48" (1/1) ... [2024-11-20 09:06:48,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ce6006 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:48, skipping insertion in model container [2024-11-20 09:06:48,806 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:06:48" (1/1) ... [2024-11-20 09:06:48,836 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 09:06:49,034 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-31.i[917,930] [2024-11-20 09:06:49,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:06:49,129 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 09:06:49,142 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-31.i[917,930] [2024-11-20 09:06:49,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 09:06:49,219 INFO L204 MainTranslator]: Completed translation [2024-11-20 09:06:49,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49 WrapperNode [2024-11-20 09:06:49,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 09:06:49,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 09:06:49,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 09:06:49,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 09:06:49,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,296 INFO L138 Inliner]: procedures = 34, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2024-11-20 09:06:49,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 09:06:49,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 09:06:49,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 09:06:49,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 09:06:49,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,322 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,357 INFO L175 MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2024-11-20 09:06:49,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 09:06:49,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 09:06:49,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 09:06:49,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 09:06:49,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (1/1) ... [2024-11-20 09:06:49,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 09:06:49,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 09:06:49,453 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-20 09:06:49,459 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-20 09:06:49,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 09:06:49,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-20 09:06:49,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-20 09:06:49,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-20 09:06:49,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-20 09:06:49,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-20 09:06:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-20 09:06:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 09:06:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 09:06:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 09:06:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 09:06:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 09:06:49,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 09:06:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-20 09:06:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-20 09:06:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-20 09:06:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-20 09:06:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 09:06:49,507 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 09:06:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 09:06:49,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 09:06:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-20 09:06:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-20 09:06:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 09:06:49,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 09:06:49,673 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 09:06:49,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 09:06:50,334 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-20 09:06:50,334 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 09:06:50,351 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 09:06:50,351 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 09:06:50,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:06:50 BoogieIcfgContainer [2024-11-20 09:06:50,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 09:06:50,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 09:06:50,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 09:06:50,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 09:06:50,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:06:48" (1/3) ... [2024-11-20 09:06:50,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e151a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:06:50, skipping insertion in model container [2024-11-20 09:06:50,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:06:49" (2/3) ... [2024-11-20 09:06:50,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e151a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:06:50, skipping insertion in model container [2024-11-20 09:06:50,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:06:50" (3/3) ... [2024-11-20 09:06:50,363 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-31.i [2024-11-20 09:06:50,378 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 09:06:50,379 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 09:06:50,450 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 09:06:50,459 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;@3c6b5861, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 09:06:50,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 09:06:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:50,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 09:06:50,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:50,480 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:50,480 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:50,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:50,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2081525877, now seen corresponding path program 1 times [2024-11-20 09:06:50,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:06:50,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422630916] [2024-11-20 09:06:50,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:50,504 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-20 09:06:50,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:06:50,507 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-20 09:06:50,509 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-20 09:06:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:50,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 09:06:50,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:06:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-20 09:06:50,887 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:06:50,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:06:50,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422630916] [2024-11-20 09:06:50,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422630916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:50,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:50,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 09:06:50,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763481385] [2024-11-20 09:06:50,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:50,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 09:06:50,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:06:50,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 09:06:50,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 09:06:50,922 INFO L87 Difference]: Start difference. First operand has 87 states, 73 states have (on average 1.452054794520548) internal successors, (106), 74 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:06:50,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:50,950 INFO L93 Difference]: Finished difference Result 164 states and 256 transitions. [2024-11-20 09:06:50,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 09:06:50,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-20 09:06:50,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:50,959 INFO L225 Difference]: With dead ends: 164 [2024-11-20 09:06:50,960 INFO L226 Difference]: Without dead ends: 80 [2024-11-20 09:06:50,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 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-20 09:06:50,966 INFO L432 NwaCegarLoop]: 114 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, 114 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-20 09:06:50,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:06:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-20 09:06:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-20 09:06:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:51,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 114 transitions. [2024-11-20 09:06:51,013 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 114 transitions. Word has length 94 [2024-11-20 09:06:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:51,014 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 114 transitions. [2024-11-20 09:06:51,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:06:51,018 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 114 transitions. [2024-11-20 09:06:51,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 09:06:51,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:51,023 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:51,032 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-20 09:06:51,224 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-20 09:06:51,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:51,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:51,225 INFO L85 PathProgramCache]: Analyzing trace with hash -532540963, now seen corresponding path program 1 times [2024-11-20 09:06:51,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:06:51,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784047726] [2024-11-20 09:06:51,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:51,227 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-20 09:06:51,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:06:51,229 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-20 09:06:51,230 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-20 09:06:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:51,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 09:06:51,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:06:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-20 09:06:51,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:06:51,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:06:51,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784047726] [2024-11-20 09:06:51,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784047726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:51,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:51,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 09:06:51,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243694848] [2024-11-20 09:06:51,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:51,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 09:06:51,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:06:51,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 09:06:51,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 09:06:51,553 INFO L87 Difference]: Start difference. First operand 80 states and 114 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:06:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:51,626 INFO L93 Difference]: Finished difference Result 159 states and 228 transitions. [2024-11-20 09:06:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 09:06:51,627 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 94 [2024-11-20 09:06:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:51,629 INFO L225 Difference]: With dead ends: 159 [2024-11-20 09:06:51,631 INFO L226 Difference]: Without dead ends: 82 [2024-11-20 09:06:51,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 91 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-20 09:06:51,633 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 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-20 09:06:51,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 09:06:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-20 09:06:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-20 09:06:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 69 states have internal predecessors, (94), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 116 transitions. [2024-11-20 09:06:51,646 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 116 transitions. Word has length 94 [2024-11-20 09:06:51,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:51,649 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 116 transitions. [2024-11-20 09:06:51,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-20 09:06:51,650 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 116 transitions. [2024-11-20 09:06:51,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 09:06:51,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:51,651 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:51,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 09:06:51,852 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-20 09:06:51,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:51,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:51,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1918744357, now seen corresponding path program 1 times [2024-11-20 09:06:51,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:06:51,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2128718225] [2024-11-20 09:06:51,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:51,854 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-20 09:06:51,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:06:51,857 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-20 09:06:51,858 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-20 09:06:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:52,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 09:06:52,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:06:52,211 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 17 treesize of output 9 [2024-11-20 09:06:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:52,245 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:06:52,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:06:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2128718225] [2024-11-20 09:06:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2128718225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:52,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:52,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:06:52,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580810130] [2024-11-20 09:06:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:52,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:06:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:06:52,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:06:52,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:06:52,250 INFO L87 Difference]: Start difference. First operand 82 states and 116 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:52,318 INFO L93 Difference]: Finished difference Result 161 states and 229 transitions. [2024-11-20 09:06:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:06:52,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-20 09:06:52,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:52,324 INFO L225 Difference]: With dead ends: 161 [2024-11-20 09:06:52,324 INFO L226 Difference]: Without dead ends: 82 [2024-11-20 09:06:52,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:06:52,330 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:52,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:06:52,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-20 09:06:52,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-20 09:06:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:52,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2024-11-20 09:06:52,338 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 94 [2024-11-20 09:06:52,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:52,338 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2024-11-20 09:06:52,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2024-11-20 09:06:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 09:06:52,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:52,341 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:52,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 09:06:52,545 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-20 09:06:52,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:52,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:52,547 INFO L85 PathProgramCache]: Analyzing trace with hash 787875037, now seen corresponding path program 1 times [2024-11-20 09:06:52,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:06:52,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4867012] [2024-11-20 09:06:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:52,549 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-20 09:06:52,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:06:52,551 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-20 09:06:52,552 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-20 09:06:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:52,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 09:06:52,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:06:54,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2024-11-20 09:06:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:54,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:06:54,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:06:54,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4867012] [2024-11-20 09:06:54,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4867012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:54,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:54,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 09:06:54,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558963901] [2024-11-20 09:06:54,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:54,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 09:06:54,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:06:54,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 09:06:54,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 09:06:54,670 INFO L87 Difference]: Start difference. First operand 82 states and 115 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:55,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:55,544 INFO L93 Difference]: Finished difference Result 195 states and 274 transitions. [2024-11-20 09:06:55,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 09:06:55,545 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2024-11-20 09:06:55,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:55,546 INFO L225 Difference]: With dead ends: 195 [2024-11-20 09:06:55,547 INFO L226 Difference]: Without dead ends: 116 [2024-11-20 09:06:55,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 09:06:55,548 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 105 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:55,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 292 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 09:06:55,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-20 09:06:55,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 86. [2024-11-20 09:06:55,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2024-11-20 09:06:55,563 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 120 transitions. Word has length 94 [2024-11-20 09:06:55,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:55,565 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 120 transitions. [2024-11-20 09:06:55,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 120 transitions. [2024-11-20 09:06:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 09:06:55,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:55,567 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:55,579 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-20 09:06:55,767 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-20 09:06:55,768 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:55,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:55,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1840859288, now seen corresponding path program 1 times [2024-11-20 09:06:55,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:06:55,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505134638] [2024-11-20 09:06:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:55,769 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-20 09:06:55,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:06:55,771 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-20 09:06:55,772 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-20 09:06:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:56,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 09:06:56,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:06:56,044 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 17 treesize of output 9 [2024-11-20 09:06:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-20 09:06:56,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 09:06:56,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 09:06:56,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505134638] [2024-11-20 09:06:56,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505134638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 09:06:56,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 09:06:56,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 09:06:56,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539698047] [2024-11-20 09:06:56,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 09:06:56,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 09:06:56,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 09:06:56,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 09:06:56,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:06:56,060 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 09:06:56,082 INFO L93 Difference]: Finished difference Result 169 states and 237 transitions. [2024-11-20 09:06:56,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 09:06:56,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2024-11-20 09:06:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 09:06:56,084 INFO L225 Difference]: With dead ends: 169 [2024-11-20 09:06:56,084 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 09:06:56,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 09:06:56,085 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 09:06:56,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 09:06:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 09:06:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-20 09:06:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-20 09:06:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 119 transitions. [2024-11-20 09:06:56,094 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 119 transitions. Word has length 96 [2024-11-20 09:06:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 09:06:56,094 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 119 transitions. [2024-11-20 09:06:56,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-20 09:06:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 119 transitions. [2024-11-20 09:06:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 09:06:56,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 09:06:56,096 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 09:06:56,104 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 (6)] Ended with exit code 0 [2024-11-20 09:06:56,299 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-20 09:06:56,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 09:06:56,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 09:06:56,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1447832278, now seen corresponding path program 1 times [2024-11-20 09:06:56,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 09:06:56,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202235512] [2024-11-20 09:06:56,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 09:06:56,301 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-20 09:06:56,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 09:06:56,304 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-20 09:06:56,305 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-20 09:06:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 09:06:56,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-20 09:06:56,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 09:06:57,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-20 09:06:58,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 09:06:58,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 09:06:59,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2024-11-20 09:06:59,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 38 [2024-11-20 09:07:03,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2024-11-20 09:07:03,236 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2024-11-20 09:07:03,466 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 68 treesize of output 82 [2024-11-20 09:07:06,896 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 83 treesize of output 88 [2024-11-20 09:07:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 109 proven. 61 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-20 09:07:10,187 INFO L311 TraceCheckSpWp]: Computing backward predicates...