./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.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 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:07:10,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:07:10,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:07:10,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:07:10,992 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:07:11,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:07:11,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:07:11,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:07:11,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:07:11,019 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:07:11,019 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:07:11,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:07:11,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:07:11,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:07:11,020 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:07:11,021 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:07:11,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:07:11,021 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:07:11,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:07:11,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:07:11,022 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:07:11,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:07:11,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:07:11,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:07:11,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:07:11,028 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:07:11,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:07:11,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:07:11,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:07:11,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:07:11,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:07:11,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:07:11,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:07:11,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:07:11,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:07:11,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:07:11,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:07:11,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:07:11,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:07:11,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:07:11,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:07:11,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:07:11,031 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 -> 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 [2024-11-16 17:07:11,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:07:11,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:07:11,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:07:11,242 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:07:11,243 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:07:11,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2024-11-16 17:07:12,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:07:12,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:07:12,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2024-11-16 17:07:12,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9109b4f6a/287b833d20134e85bf506fcf42eca6c3/FLAGcb3914f7a [2024-11-16 17:07:13,002 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9109b4f6a/287b833d20134e85bf506fcf42eca6c3 [2024-11-16 17:07:13,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:07:13,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:07:13,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:07:13,006 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:07:13,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:07:13,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab7ea63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13, skipping insertion in model container [2024-11-16 17:07:13,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:07:13,187 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_operatoramount_amount100_file-6.i[915,928] [2024-11-16 17:07:13,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:07:13,288 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:07:13,296 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_operatoramount_amount100_file-6.i[915,928] [2024-11-16 17:07:13,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:07:13,346 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:07:13,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13 WrapperNode [2024-11-16 17:07:13,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:07:13,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:07:13,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:07:13,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:07:13,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,401 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-16 17:07:13,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:07:13,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:07:13,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:07:13,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:07:13,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,414 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,435 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:07:13,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:07:13,469 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:07:13,470 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:07:13,470 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:07:13,470 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (1/1) ... [2024-11-16 17:07:13,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:07:13,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:07:13,498 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-16 17:07:13,500 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-16 17:07:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:07:13,536 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:07:13,537 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:07:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:07:13,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:07:13,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:07:13,611 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:07:13,612 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:07:13,908 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L179: havoc property_#t~ite20#1;havoc property_#t~ite19#1;havoc property_#t~bitwise18#1;havoc property_#t~short21#1; [2024-11-16 17:07:13,933 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-16 17:07:13,933 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:07:13,947 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:07:13,948 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:07:13,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:07:13 BoogieIcfgContainer [2024-11-16 17:07:13,949 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:07:13,951 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:07:13,951 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:07:13,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:07:13,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:07:13" (1/3) ... [2024-11-16 17:07:13,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e41056f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:07:13, skipping insertion in model container [2024-11-16 17:07:13,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:13" (2/3) ... [2024-11-16 17:07:13,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e41056f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:07:13, skipping insertion in model container [2024-11-16 17:07:13,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:07:13" (3/3) ... [2024-11-16 17:07:13,957 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-6.i [2024-11-16 17:07:13,970 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:07:13,970 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:07:14,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:07:14,028 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;@17ee824f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:07:14,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:07:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 69 states have internal predecessors, (98), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 17:07:14,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-16 17:07:14,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:14,047 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:07:14,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:14,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:14,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1848404877, now seen corresponding path program 1 times [2024-11-16 17:07:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:14,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393197552] [2024-11-16 17:07:14,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:14,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:14,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:14,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:07:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:07:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 17:07:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 17:07:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 17:07:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:07:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:07:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:07:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:07:14,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:07:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:07:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:07:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 17:07:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 17:07:14,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:14,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393197552] [2024-11-16 17:07:14,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393197552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:14,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:14,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:07:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498519860] [2024-11-16 17:07:14,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:14,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:07:14,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:14,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:07:14,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:07:14,426 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 69 states have internal predecessors, (98), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 17:07:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:14,453 INFO L93 Difference]: Finished difference Result 179 states and 302 transitions. [2024-11-16 17:07:14,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:07:14,455 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 155 [2024-11-16 17:07:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:14,477 INFO L225 Difference]: With dead ends: 179 [2024-11-16 17:07:14,478 INFO L226 Difference]: Without dead ends: 88 [2024-11-16 17:07:14,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-16 17:07:14,485 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:14,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:07:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-16 17:07:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-16 17:07:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 17:07:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 133 transitions. [2024-11-16 17:07:14,544 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 133 transitions. Word has length 155 [2024-11-16 17:07:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:14,545 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 133 transitions. [2024-11-16 17:07:14,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 17:07:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 133 transitions. [2024-11-16 17:07:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-16 17:07:14,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:14,550 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:07:14,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:07:14,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:14,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2137154448, now seen corresponding path program 1 times [2024-11-16 17:07:14,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:14,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064460722] [2024-11-16 17:07:14,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:14,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:07:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:07:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 17:07:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 17:07:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 17:07:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:07:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:07:14,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:07:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:07:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:07:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:07:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:07:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 17:07:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 17:07:14,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:14,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064460722] [2024-11-16 17:07:14,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064460722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:14,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:14,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:07:14,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819706901] [2024-11-16 17:07:14,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:14,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:07:14,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:14,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:07:14,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:07:14,812 INFO L87 Difference]: Start difference. First operand 88 states and 133 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 17:07:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:14,903 INFO L93 Difference]: Finished difference Result 261 states and 386 transitions. [2024-11-16 17:07:14,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:07:14,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 155 [2024-11-16 17:07:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:14,908 INFO L225 Difference]: With dead ends: 261 [2024-11-16 17:07:14,910 INFO L226 Difference]: Without dead ends: 176 [2024-11-16 17:07:14,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:07:14,911 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 158 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:14,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 344 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:07:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-16 17:07:14,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 146. [2024-11-16 17:07:14,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 118 states have (on average 1.423728813559322) internal successors, (168), 119 states have internal predecessors, (168), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 17:07:14,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2024-11-16 17:07:14,939 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 155 [2024-11-16 17:07:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:14,941 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2024-11-16 17:07:14,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 17:07:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2024-11-16 17:07:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-16 17:07:14,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:14,945 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:07:14,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:07:14,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:14,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash -804503151, now seen corresponding path program 1 times [2024-11-16 17:07:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:14,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188460439] [2024-11-16 17:07:14,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:14,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:07:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:07:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 17:07:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 17:07:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 17:07:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:07:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:07:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:07:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:07:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:07:15,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:07:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:07:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 17:07:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-16 17:07:15,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188460439] [2024-11-16 17:07:15,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188460439] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:07:15,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020084367] [2024-11-16 17:07:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:15,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:07:15,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:07:15,770 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-16 17:07:15,775 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-16 17:07:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:15,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-16 17:07:15,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:07:16,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-16 17:07:16,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:07:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-16 17:07:16,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020084367] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:07:16,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:07:16,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 26 [2024-11-16 17:07:16,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730670674] [2024-11-16 17:07:16,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:07:16,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-16 17:07:16,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:16,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-16 17:07:16,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2024-11-16 17:07:16,838 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand has 26 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 24 states have internal predecessors, (95), 7 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) [2024-11-16 17:07:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:18,322 INFO L93 Difference]: Finished difference Result 552 states and 784 transitions. [2024-11-16 17:07:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-16 17:07:18,323 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 24 states have internal predecessors, (95), 7 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) Word has length 155 [2024-11-16 17:07:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:18,327 INFO L225 Difference]: With dead ends: 552 [2024-11-16 17:07:18,327 INFO L226 Difference]: Without dead ends: 409 [2024-11-16 17:07:18,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 975 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1034, Invalid=3126, Unknown=0, NotChecked=0, Total=4160 [2024-11-16 17:07:18,329 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 568 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:18,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1257 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 17:07:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-16 17:07:18,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 236. [2024-11-16 17:07:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 181 states have internal predecessors, (240), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 17:07:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 336 transitions. [2024-11-16 17:07:18,356 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 336 transitions. Word has length 155 [2024-11-16 17:07:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:18,356 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 336 transitions. [2024-11-16 17:07:18,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 24 states have internal predecessors, (95), 7 states have call successors, (38), 3 states have call predecessors, (38), 6 states have return successors, (39), 6 states have call predecessors, (39), 7 states have call successors, (39) [2024-11-16 17:07:18,357 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 336 transitions. [2024-11-16 17:07:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-16 17:07:18,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:18,358 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:07:18,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 17:07:18,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:07:18,560 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:18,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1563453220, now seen corresponding path program 1 times [2024-11-16 17:07:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:18,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984332336] [2024-11-16 17:07:18,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:18,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:07:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:07:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 17:07:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 17:07:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 17:07:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:07:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:07:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:07:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:07:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:07:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:07:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:07:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 17:07:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-16 17:07:18,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984332336] [2024-11-16 17:07:18,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984332336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:07:18,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012333341] [2024-11-16 17:07:18,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:18,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:07:18,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:07:18,860 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-16 17:07:18,862 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-16 17:07:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:18,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 17:07:18,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:07:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-16 17:07:19,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:07:19,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-16 17:07:19,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012333341] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:07:19,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:07:19,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-16 17:07:19,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087294529] [2024-11-16 17:07:19,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:07:19,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:07:19,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:19,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:07:19,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:07:19,297 INFO L87 Difference]: Start difference. First operand 236 states and 336 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2024-11-16 17:07:19,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:19,432 INFO L93 Difference]: Finished difference Result 457 states and 641 transitions. [2024-11-16 17:07:19,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 17:07:19,433 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) Word has length 156 [2024-11-16 17:07:19,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:19,435 INFO L225 Difference]: With dead ends: 457 [2024-11-16 17:07:19,437 INFO L226 Difference]: Without dead ends: 224 [2024-11-16 17:07:19,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-16 17:07:19,440 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 123 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:19,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 245 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:07:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-16 17:07:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 216. [2024-11-16 17:07:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 157 states have (on average 1.2929936305732483) internal successors, (203), 159 states have internal predecessors, (203), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 17:07:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 299 transitions. [2024-11-16 17:07:19,483 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 299 transitions. Word has length 156 [2024-11-16 17:07:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:19,484 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 299 transitions. [2024-11-16 17:07:19,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2024-11-16 17:07:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 299 transitions. [2024-11-16 17:07:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-16 17:07:19,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:19,487 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:07:19,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 17:07:19,691 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,SelfDestructingSolverStorable3 [2024-11-16 17:07:19,692 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:19,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:19,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2028075755, now seen corresponding path program 1 times [2024-11-16 17:07:19,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:19,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736334530] [2024-11-16 17:07:19,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:19,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:07:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:07:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 17:07:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 17:07:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 17:07:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:07:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:07:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:07:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:07:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:07:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:07:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:07:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 17:07:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 17:07:19,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:19,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736334530] [2024-11-16 17:07:19,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736334530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:19,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:19,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:07:19,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248146041] [2024-11-16 17:07:19,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:19,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:07:19,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:19,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:07:19,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:07:19,775 INFO L87 Difference]: Start difference. First operand 216 states and 299 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 17:07:19,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:19,808 INFO L93 Difference]: Finished difference Result 448 states and 629 transitions. [2024-11-16 17:07:19,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:07:19,808 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2024-11-16 17:07:19,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:19,810 INFO L225 Difference]: With dead ends: 448 [2024-11-16 17:07:19,810 INFO L226 Difference]: Without dead ends: 293 [2024-11-16 17:07:19,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-16 17:07:19,811 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 44 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:19,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 252 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:07:19,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-16 17:07:19,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 258. [2024-11-16 17:07:19,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 199 states have (on average 1.3165829145728642) internal successors, (262), 201 states have internal predecessors, (262), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 17:07:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 358 transitions. [2024-11-16 17:07:19,828 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 358 transitions. Word has length 156 [2024-11-16 17:07:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:19,828 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 358 transitions. [2024-11-16 17:07:19,828 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 17:07:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 358 transitions. [2024-11-16 17:07:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 17:07:19,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:19,830 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:07:19,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 17:07:19,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:19,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:19,830 INFO L85 PathProgramCache]: Analyzing trace with hash 695443098, now seen corresponding path program 1 times [2024-11-16 17:07:19,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:19,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581870040] [2024-11-16 17:07:19,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:19,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 17:07:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 17:07:20,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 17:07:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 17:07:20,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 17:07:20,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:07:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 17:07:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:07:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 17:07:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:07:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 17:07:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 17:07:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 17:07:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 17:07:20,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:20,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581870040] [2024-11-16 17:07:20,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581870040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:20,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:20,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:07:20,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29401657] [2024-11-16 17:07:20,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:20,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:07:20,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:20,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:07:20,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:07:20,144 INFO L87 Difference]: Start difference. First operand 258 states and 358 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 17:07:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:20,256 INFO L93 Difference]: Finished difference Result 490 states and 684 transitions. [2024-11-16 17:07:20,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:07:20,257 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), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2024-11-16 17:07:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:20,258 INFO L225 Difference]: With dead ends: 490 [2024-11-16 17:07:20,258 INFO L226 Difference]: Without dead ends: 293 [2024-11-16 17:07:20,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:07:20,259 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 159 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:20,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 339 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:07:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-16 17:07:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 262. [2024-11-16 17:07:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 202 states have (on average 1.301980198019802) internal successors, (263), 204 states have internal predecessors, (263), 48 states have call successors, (48), 11 states have call predecessors, (48), 11 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 17:07:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 359 transitions. [2024-11-16 17:07:20,276 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 359 transitions. Word has length 157 [2024-11-16 17:07:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:20,276 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 359 transitions. [2024-11-16 17:07:20,276 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), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 17:07:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 359 transitions. [2024-11-16 17:07:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-16 17:07:20,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:20,278 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:07:20,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 17:07:20,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:20,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1205977275, now seen corresponding path program 1 times [2024-11-16 17:07:20,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:20,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810285078] [2024-11-16 17:07:20,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:20,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:07:20,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:07:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:07:20,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:07:20,436 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:07:20,437 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:07:20,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 17:07:20,441 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:07:20,522 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:07:20,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:07:20 BoogieIcfgContainer [2024-11-16 17:07:20,525 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:07:20,526 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:07:20,526 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:07:20,526 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:07:20,526 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:07:13" (3/4) ... [2024-11-16 17:07:20,528 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:07:20,529 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:07:20,529 INFO L158 Benchmark]: Toolchain (without parser) took 7524.41ms. Allocated memory was 151.0MB in the beginning and 318.8MB in the end (delta: 167.8MB). Free memory was 78.2MB in the beginning and 116.6MB in the end (delta: -38.3MB). Peak memory consumption was 130.6MB. Max. memory is 16.1GB. [2024-11-16 17:07:20,530 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:07:20,530 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.23ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 78.1MB in the beginning and 171.0MB in the end (delta: -92.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-16 17:07:20,530 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.21ms. Allocated memory is still 203.4MB. Free memory was 171.0MB in the beginning and 165.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 17:07:20,530 INFO L158 Benchmark]: Boogie Preprocessor took 65.91ms. Allocated memory is still 203.4MB. Free memory was 165.7MB in the beginning and 156.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 17:07:20,530 INFO L158 Benchmark]: IcfgBuilder took 479.79ms. Allocated memory is still 203.4MB. Free memory was 156.3MB in the beginning and 125.9MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 17:07:20,531 INFO L158 Benchmark]: TraceAbstraction took 6574.68ms. Allocated memory was 203.4MB in the beginning and 318.8MB in the end (delta: 115.3MB). Free memory was 125.9MB in the beginning and 116.6MB in the end (delta: 9.3MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. [2024-11-16 17:07:20,531 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 318.8MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:07:20,532 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.15ms. Allocated memory is still 151.0MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.23ms. Allocated memory was 151.0MB in the beginning and 203.4MB in the end (delta: 52.4MB). Free memory was 78.1MB in the beginning and 171.0MB in the end (delta: -92.9MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.21ms. Allocated memory is still 203.4MB. Free memory was 171.0MB in the beginning and 165.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.91ms. Allocated memory is still 203.4MB. Free memory was 165.7MB in the beginning and 156.3MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 479.79ms. Allocated memory is still 203.4MB. Free memory was 156.3MB in the beginning and 125.9MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6574.68ms. Allocated memory was 203.4MB in the beginning and 318.8MB in the end (delta: 115.3MB). Free memory was 125.9MB in the beginning and 116.6MB in the end (delta: 9.3MB). Peak memory consumption was 124.7MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 318.8MB. Free memory is still 116.6MB. 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 179, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryArithmeticDOUBLEoperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned short int var_1_5 = 34011; [L26] unsigned short int var_1_6 = 2; [L27] signed short int var_1_7 = -4; [L28] signed long int var_1_9 = -4; [L29] unsigned short int var_1_10 = 4; [L30] double var_1_12 = 1.8; [L31] double var_1_13 = 49.5; [L32] double var_1_14 = 0.0; [L33] double var_1_15 = 8.5; [L34] unsigned long int var_1_16 = 4; [L35] float var_1_17 = 3.65; [L36] unsigned char var_1_18 = 0; [L37] signed long int var_1_19 = 32; [L38] signed long int var_1_20 = 1000000000; [L39] signed long int var_1_21 = 1141305717; [L40] unsigned char var_1_22 = 50; [L41] unsigned char var_1_23 = 0; [L42] unsigned short int var_1_24 = 2; [L43] signed short int var_1_25 = -16; [L44] double var_1_26 = 15.6; [L45] double var_1_27 = 4.25; [L46] unsigned long int var_1_28 = 10; [L47] unsigned char last_1_var_1_22 = 50; VAL [isInitial=0, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L176] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L138] var_1_2 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L139] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L140] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L140] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L141] var_1_3 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L142] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L143] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L143] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L144] var_1_5 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L145] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L146] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L146] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=2, var_1_7=-4, var_1_9=-4] [L147] var_1_6 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_7=-4, var_1_9=-4] [L148] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_7=-4, var_1_9=-4] [L149] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L149] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L150] var_1_13 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L151] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L152] var_1_14 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L153] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L154] var_1_15 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L155] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L156] var_1_18 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L157] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L158] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L158] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L159] var_1_20 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_20 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L160] RET assume_abort_if_not(var_1_20 >= 536870911) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L161] CALL assume_abort_if_not(var_1_20 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L161] RET assume_abort_if_not(var_1_20 <= 1073741823) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L162] var_1_21 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_21 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L163] RET assume_abort_if_not(var_1_21 >= 1073741822) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L164] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L164] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L165] var_1_23 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L166] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L167] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L167] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L168] var_1_26 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L169] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L170] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L170] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L171] var_1_27 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L172] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L173] CALL assume_abort_if_not(var_1_27 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L173] RET assume_abort_if_not(var_1_27 != 0.0F) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=-4] [L187] RET updateVariables() [L188] CALL step() [L51] var_1_9 = (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22) [L52] unsigned char stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_2=-255, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=0] [L53] COND TRUE stepLocal_2 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3)) [L54] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=0] [L58] COND TRUE var_1_2 || var_1_3 [L59] var_1_1 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=-4, var_1_9=0] [L63] COND FALSE !(var_1_22 <= (- 500)) [L68] var_1_7 = var_1_22 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L70] var_1_10 = (var_1_5 - (var_1_22 + 1000)) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L71] COND FALSE !(! var_1_3) [L74] var_1_12 = (var_1_14 - var_1_13) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L76] unsigned char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=254, var_1_10=64280, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L77] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=254, var_1_10=64280, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L80] COND TRUE ((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= stepLocal_0 [L81] var_1_16 = 128u VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L86] COND TRUE \read(var_1_18) [L87] var_1_17 = (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L99] var_1_28 = var_1_21 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L100] COND TRUE ! ((! var_1_3) && var_1_18) [L101] var_1_24 = ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L107] unsigned short int stepLocal_4 = var_1_24; [L108] unsigned short int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=64280, stepLocal_4=254, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L109] COND FALSE !(((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=64280, stepLocal_4=254, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L122] unsigned char stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_1=254, stepLocal_3=64280, stepLocal_4=254, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L123] COND TRUE var_1_24 >= stepLocal_1 VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=64280, stepLocal_4=254, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L124] COND TRUE ! var_1_2 [L125] var_1_19 = (var_1_22 - (var_1_22 + (var_1_20 - 5))) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=64280, stepLocal_4=254, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L188] RET step() [L189] CALL, EXPR property() [L179] EXPR (((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L179-L180] return ((((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1)) && (var_1_28 == ((unsigned long int) var_1_21)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=50, var_1_10=64280, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16646146, var_1_6=0, var_1_7=254, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1071 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1052 mSDsluCounter, 2568 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1618 mSDsCounter, 246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1512 IncrementalHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 246 mSolverCounterUnsat, 950 mSDtfsCounter, 1512 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 999 GetRequests, 921 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=6, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 277 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1402 NumberOfCodeBlocks, 1402 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1546 ConstructedInterpolants, 0 QuantifiedInterpolants, 3399 SizeOfPredicates, 12 NumberOfNonLiveVariables, 712 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 9862/10120 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-16 17:07:20,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.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 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:07:22,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:07:22,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:07:22,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:07:22,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:07:22,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:07:22,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:07:22,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:07:22,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:07:22,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:07:22,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:07:22,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:07:22,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:07:22,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:07:22,419 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:07:22,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:07:22,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:07:22,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:07:22,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:07:22,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:07:22,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:07:22,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:07:22,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:07:22,423 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:07:22,423 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:07:22,423 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:07:22,423 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:07:22,423 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:07:22,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:07:22,424 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:07:22,424 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:07:22,424 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:07:22,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:07:22,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:07:22,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:07:22,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:07:22,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:07:22,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:07:22,425 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:07:22,425 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:07:22,425 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:07:22,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:07:22,426 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:07:22,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:07:22,426 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 -> 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 [2024-11-16 17:07:22,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:07:22,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:07:22,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:07:22,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:07:22,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:07:22,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2024-11-16 17:07:24,063 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:07:24,239 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:07:24,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2024-11-16 17:07:24,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10a17cd3/f0072e2724ff44358f1840f8b8d82390/FLAGf4cb34a13 [2024-11-16 17:07:24,260 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f10a17cd3/f0072e2724ff44358f1840f8b8d82390 [2024-11-16 17:07:24,262 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:07:24,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:07:24,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:07:24,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:07:24,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:07:24,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6543117d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24, skipping insertion in model container [2024-11-16 17:07:24,270 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,295 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:07:24,432 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_operatoramount_amount100_file-6.i[915,928] [2024-11-16 17:07:24,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:07:24,520 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:07:24,530 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_operatoramount_amount100_file-6.i[915,928] [2024-11-16 17:07:24,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:07:24,590 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:07:24,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24 WrapperNode [2024-11-16 17:07:24,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:07:24,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:07:24,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:07:24,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:07:24,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,612 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,644 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2024-11-16 17:07:24,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:07:24,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:07:24,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:07:24,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:07:24,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,690 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:07:24,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,703 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,705 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,707 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:07:24,710 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:07:24,710 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:07:24,710 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:07:24,711 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (1/1) ... [2024-11-16 17:07:24,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:07:24,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:07:24,741 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-16 17:07:24,743 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-16 17:07:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:07:24,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:07:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:07:24,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:07:24,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:07:24,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:07:24,862 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:07:24,865 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:07:41,557 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 17:07:41,557 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:07:41,568 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:07:41,568 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:07:41,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:07:41 BoogieIcfgContainer [2024-11-16 17:07:41,569 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:07:41,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:07:41,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:07:41,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:07:41,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:07:24" (1/3) ... [2024-11-16 17:07:41,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36458bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:07:41, skipping insertion in model container [2024-11-16 17:07:41,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:24" (2/3) ... [2024-11-16 17:07:41,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36458bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:07:41, skipping insertion in model container [2024-11-16 17:07:41,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:07:41" (3/3) ... [2024-11-16 17:07:41,576 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-6.i [2024-11-16 17:07:41,590 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:07:41,590 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:07:41,640 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:07:41,645 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;@2f0045bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:07:41,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:07:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 17:07:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 17:07:41,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:41,659 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:07:41,659 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:41,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash 323414955, now seen corresponding path program 1 times [2024-11-16 17:07:41,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:07:41,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070244409] [2024-11-16 17:07:41,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:41,673 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-16 17:07:41,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:07:41,676 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-16 17:07:41,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 17:07:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:42,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:07:42,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:07:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-16 17:07:42,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:07:42,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:07:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070244409] [2024-11-16 17:07:42,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070244409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:42,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:42,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:07:42,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107595176] [2024-11-16 17:07:42,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:42,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:07:42,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:07:42,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:07:42,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:07:42,754 INFO L87 Difference]: Start difference. First operand has 83 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 17:07:42,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:42,775 INFO L93 Difference]: Finished difference Result 157 states and 270 transitions. [2024-11-16 17:07:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:07:42,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2024-11-16 17:07:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:42,783 INFO L225 Difference]: With dead ends: 157 [2024-11-16 17:07:42,783 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 17:07:42,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-16 17:07:42,788 INFO L432 NwaCegarLoop]: 117 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, 117 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-16 17:07:42,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:07:42,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 17:07:42,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-16 17:07:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 17:07:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-16 17:07:42,825 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 153 [2024-11-16 17:07:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:42,826 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-16 17:07:42,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 17:07:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-16 17:07:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 17:07:42,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:42,829 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:07:42,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 17:07:43,029 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-16 17:07:43,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:43,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash -829355922, now seen corresponding path program 1 times [2024-11-16 17:07:43,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:07:43,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662932895] [2024-11-16 17:07:43,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:43,032 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-16 17:07:43,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:07:43,034 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-16 17:07:43,035 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-16 17:07:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 17:07:44,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:07:44,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-16 17:07:44,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:07:44,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:07:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662932895] [2024-11-16 17:07:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662932895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:44,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:44,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:07:44,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198131649] [2024-11-16 17:07:44,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:44,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:07:44,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:07:44,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:07:44,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:07:44,398 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 17:07:46,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:07:48,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:07:53,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:07:57,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:08:01,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:08:05,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:08:09,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:08:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:08:09,515 INFO L93 Difference]: Finished difference Result 217 states and 322 transitions. [2024-11-16 17:08:09,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:08:09,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2024-11-16 17:08:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:08:09,518 INFO L225 Difference]: With dead ends: 217 [2024-11-16 17:08:09,518 INFO L226 Difference]: Without dead ends: 143 [2024-11-16 17:08:09,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:08:09,520 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 82 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:08:09,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 362 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 25.1s Time] [2024-11-16 17:08:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-16 17:08:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 122. [2024-11-16 17:08:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 95 states have internal predecessors, (133), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-16 17:08:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 183 transitions. [2024-11-16 17:08:09,534 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 183 transitions. Word has length 153 [2024-11-16 17:08:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:08:09,535 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 183 transitions. [2024-11-16 17:08:09,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-16 17:08:09,535 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 183 transitions. [2024-11-16 17:08:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-16 17:08:09,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:08:09,537 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:08:09,567 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-16 17:08:09,737 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-16 17:08:09,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:08:09,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:08:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash 678195887, now seen corresponding path program 1 times [2024-11-16 17:08:09,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:08:09,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1437462065] [2024-11-16 17:08:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:08:09,739 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-16 17:08:09,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:08:09,740 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-16 17:08:09,741 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-16 17:08:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:08:10,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 17:08:10,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:08:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-16 17:08:13,458 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:08:15,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:08:15,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1437462065] [2024-11-16 17:08:15,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1437462065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:08:15,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [138181336] [2024-11-16 17:08:15,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:08:15,724 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 17:08:15,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 17:08:15,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 17:08:15,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-16 17:08:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:08:18,225 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 17:08:18,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:08:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-16 17:08:19,817 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:08:20,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [138181336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:08:20,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 17:08:20,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2024-11-16 17:08:20,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111434227] [2024-11-16 17:08:20,715 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 17:08:20,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 17:08:20,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:08:20,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 17:08:20,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-16 17:08:20,720 INFO L87 Difference]: Start difference. First operand 122 states and 183 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 17:08:30,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:08:34,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:08:38,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:08:42,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 17:08:46,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 17:08:50,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []