./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-16.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_loopvsstraightlinecode_100-1loop_file-16.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 f7a7425e896251d765b196e2267bf51e4ef5d4f864eb4111189d282f80a6908b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:56:31,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:56:31,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:56:31,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:56:31,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:56:31,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:56:31,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:56:31,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:56:31,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:56:31,858 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:56:31,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:56:31,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:56:31,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:56:31,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:56:31,860 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:56:31,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:56:31,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:56:31,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:56:31,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:56:31,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:56:31,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:56:31,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:56:31,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:56:31,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:56:31,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:56:31,863 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:56:31,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:56:31,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:56:31,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:56:31,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:56:31,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:56:31,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:56:31,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:56:31,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:56:31,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:56:31,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:56:31,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:56:31,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:56:31,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:56:31,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:56:31,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:56:31,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:56:31,869 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 -> f7a7425e896251d765b196e2267bf51e4ef5d4f864eb4111189d282f80a6908b [2024-11-16 15:56:32,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:56:32,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:56:32,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:56:32,136 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:56:32,136 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:56:32,137 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-16 15:56:33,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:56:33,790 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:56:33,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-16 15:56:33,806 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4352f79d/3a32d58aa3254c40a09b1e67770f6f66/FLAGa72e9f62a [2024-11-16 15:56:34,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4352f79d/3a32d58aa3254c40a09b1e67770f6f66 [2024-11-16 15:56:34,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:56:34,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:56:34,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:56:34,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:56:34,150 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:56:34,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d58c90e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34, skipping insertion in model container [2024-11-16 15:56:34,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,190 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:56:34,357 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_loopvsstraightlinecode_100-1loop_file-16.i[916,929] [2024-11-16 15:56:34,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:56:34,456 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:56:34,467 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_loopvsstraightlinecode_100-1loop_file-16.i[916,929] [2024-11-16 15:56:34,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:56:34,530 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:56:34,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34 WrapperNode [2024-11-16 15:56:34,531 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:56:34,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:56:34,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:56:34,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:56:34,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,596 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-11-16 15:56:34,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:56:34,597 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:56:34,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:56:34,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:56:34,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,653 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 15:56:34,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:56:34,705 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:56:34,705 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:56:34,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:56:34,706 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (1/1) ... [2024-11-16 15:56:34,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:56:34,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:56:34,739 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 15:56:34,742 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 15:56:34,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:56:34,789 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:56:34,790 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:56:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:56:34,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:56:34,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:56:34,875 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:56:34,878 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:56:35,416 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L179: havoc property_#t~ite22#1;havoc property_#t~ite21#1;havoc property_#t~bitwise18#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short23#1; [2024-11-16 15:56:35,461 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-16 15:56:35,461 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:56:35,488 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:56:35,488 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:56:35,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:35 BoogieIcfgContainer [2024-11-16 15:56:35,489 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:56:35,493 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:56:35,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:56:35,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:56:35,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:56:34" (1/3) ... [2024-11-16 15:56:35,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca9fbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:35, skipping insertion in model container [2024-11-16 15:56:35,498 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:34" (2/3) ... [2024-11-16 15:56:35,499 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca9fbab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:35, skipping insertion in model container [2024-11-16 15:56:35,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:35" (3/3) ... [2024-11-16 15:56:35,501 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-16 15:56:35,517 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:56:35,518 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:56:35,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:56:35,596 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;@59f7781e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:56:35,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:56:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:56:35,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 15:56:35,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:35,621 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:35,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:35,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:35,629 INFO L85 PathProgramCache]: Analyzing trace with hash -599690628, now seen corresponding path program 1 times [2024-11-16 15:56:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:35,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368547882] [2024-11-16 15:56:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:35,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:35,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:35,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:35,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:35,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:56:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:56:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:56:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:56:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:56:36,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:36,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368547882] [2024-11-16 15:56:36,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368547882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:36,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:36,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:56:36,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605118605] [2024-11-16 15:56:36,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:56:36,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:36,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:56:36,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:56:36,169 INFO L87 Difference]: Start difference. First operand has 101 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:56:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:36,217 INFO L93 Difference]: Finished difference Result 198 states and 325 transitions. [2024-11-16 15:56:36,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:56:36,220 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 147 [2024-11-16 15:56:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:36,230 INFO L225 Difference]: With dead ends: 198 [2024-11-16 15:56:36,230 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 15:56:36,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 15:56:36,236 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:36,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:56:36,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 15:56:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-16 15:56:36,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:56:36,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-11-16 15:56:36,281 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 147 [2024-11-16 15:56:36,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:36,282 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-11-16 15:56:36,282 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:56:36,282 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-11-16 15:56:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 15:56:36,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:36,285 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:36,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:56:36,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:36,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:36,286 INFO L85 PathProgramCache]: Analyzing trace with hash 412550913, now seen corresponding path program 1 times [2024-11-16 15:56:36,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:36,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778515181] [2024-11-16 15:56:36,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:36,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:56:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:56:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:56:36,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:56:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:36,850 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:56:36,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:36,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778515181] [2024-11-16 15:56:36,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778515181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:36,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:36,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 15:56:36,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917357707] [2024-11-16 15:56:36,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:36,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:56:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:36,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:56:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:56:36,859 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:56:37,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:37,323 INFO L93 Difference]: Finished difference Result 378 states and 579 transitions. [2024-11-16 15:56:37,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:56:37,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 147 [2024-11-16 15:56:37,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:37,327 INFO L225 Difference]: With dead ends: 378 [2024-11-16 15:56:37,327 INFO L226 Difference]: Without dead ends: 285 [2024-11-16 15:56:37,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:56:37,329 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 405 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:37,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 616 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 15:56:37,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-16 15:56:37,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 188. [2024-11-16 15:56:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 143 states have (on average 1.4335664335664335) internal successors, (205), 143 states have internal predecessors, (205), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 15:56:37,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 289 transitions. [2024-11-16 15:56:37,363 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 289 transitions. Word has length 147 [2024-11-16 15:56:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:37,364 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 289 transitions. [2024-11-16 15:56:37,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:56:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 289 transitions. [2024-11-16 15:56:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 15:56:37,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:37,370 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:37,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:56:37,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:37,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash -584521440, now seen corresponding path program 1 times [2024-11-16 15:56:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:37,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770501868] [2024-11-16 15:56:37,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:37,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:37,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:38,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:38,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:56:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:56:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:56:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:56:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:56:38,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:38,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770501868] [2024-11-16 15:56:38,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770501868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:38,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:38,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 15:56:38,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480652355] [2024-11-16 15:56:38,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:38,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 15:56:38,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:38,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 15:56:38,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:56:38,162 INFO L87 Difference]: Start difference. First operand 188 states and 289 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:56:38,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:38,523 INFO L93 Difference]: Finished difference Result 744 states and 1140 transitions. [2024-11-16 15:56:38,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 15:56:38,523 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 147 [2024-11-16 15:56:38,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:38,527 INFO L225 Difference]: With dead ends: 744 [2024-11-16 15:56:38,528 INFO L226 Difference]: Without dead ends: 559 [2024-11-16 15:56:38,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 15:56:38,533 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 416 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:38,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 852 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:56:38,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-16 15:56:38,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 367. [2024-11-16 15:56:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 267 states have (on average 1.3820224719101124) internal successors, (369), 268 states have internal predecessors, (369), 93 states have call successors, (93), 6 states have call predecessors, (93), 6 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-16 15:56:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 555 transitions. [2024-11-16 15:56:38,613 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 555 transitions. Word has length 147 [2024-11-16 15:56:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:38,613 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 555 transitions. [2024-11-16 15:56:38,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:56:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 555 transitions. [2024-11-16 15:56:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 15:56:38,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:38,620 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:38,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 15:56:38,620 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:38,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash 3726688, now seen corresponding path program 1 times [2024-11-16 15:56:38,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:38,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180986665] [2024-11-16 15:56:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:38,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:56:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:56:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:56:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:56:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:56:38,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:38,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180986665] [2024-11-16 15:56:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180986665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:38,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:38,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 15:56:38,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162778320] [2024-11-16 15:56:38,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:38,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:56:38,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:38,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:56:38,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:56:38,901 INFO L87 Difference]: Start difference. First operand 367 states and 555 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:56:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:39,319 INFO L93 Difference]: Finished difference Result 717 states and 1083 transitions. [2024-11-16 15:56:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 15:56:39,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 147 [2024-11-16 15:56:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:39,327 INFO L225 Difference]: With dead ends: 717 [2024-11-16 15:56:39,329 INFO L226 Difference]: Without dead ends: 542 [2024-11-16 15:56:39,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:56:39,335 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 280 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:39,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 627 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:56:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-16 15:56:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 539. [2024-11-16 15:56:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 394 states have (on average 1.383248730964467) internal successors, (545), 395 states have internal predecessors, (545), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 134 states have call predecessors, (135), 135 states have call successors, (135) [2024-11-16 15:56:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 815 transitions. [2024-11-16 15:56:39,395 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 815 transitions. Word has length 147 [2024-11-16 15:56:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:39,397 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 815 transitions. [2024-11-16 15:56:39,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:56:39,398 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 815 transitions. [2024-11-16 15:56:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 15:56:39,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:39,414 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:39,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 15:56:39,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:39,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:39,415 INFO L85 PathProgramCache]: Analyzing trace with hash -993345665, now seen corresponding path program 1 times [2024-11-16 15:56:39,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:39,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731571770] [2024-11-16 15:56:39,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:39,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:56:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:56:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:56:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:56:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:56:40,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:40,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731571770] [2024-11-16 15:56:40,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731571770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:41,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:41,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 15:56:41,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483405849] [2024-11-16 15:56:41,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:41,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 15:56:41,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:41,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 15:56:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:56:41,002 INFO L87 Difference]: Start difference. First operand 539 states and 815 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-16 15:56:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:41,908 INFO L93 Difference]: Finished difference Result 1311 states and 1905 transitions. [2024-11-16 15:56:41,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 15:56:41,909 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 147 [2024-11-16 15:56:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:41,914 INFO L225 Difference]: With dead ends: 1311 [2024-11-16 15:56:41,914 INFO L226 Difference]: Without dead ends: 790 [2024-11-16 15:56:41,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-16 15:56:41,916 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 346 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:41,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 229 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 15:56:41,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-16 15:56:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 619. [2024-11-16 15:56:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 460 states have (on average 1.3413043478260869) internal successors, (617), 461 states have internal predecessors, (617), 135 states have call successors, (135), 23 states have call predecessors, (135), 23 states have return successors, (135), 134 states have call predecessors, (135), 135 states have call successors, (135) [2024-11-16 15:56:42,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 887 transitions. [2024-11-16 15:56:42,005 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 887 transitions. Word has length 147 [2024-11-16 15:56:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:42,006 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 887 transitions. [2024-11-16 15:56:42,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-16 15:56:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 887 transitions. [2024-11-16 15:56:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 15:56:42,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:42,008 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:42,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 15:56:42,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:42,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1494167168, now seen corresponding path program 1 times [2024-11-16 15:56:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:42,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818542254] [2024-11-16 15:56:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:56:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:56:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:56:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:56:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:56:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 15:56:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 15:56:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 15:56:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 15:56:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 15:56:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 15:56:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 15:56:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 15:56:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 15:56:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 15:56:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 15:56:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 15:56:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 15:56:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 15:56:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 15:56:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 15:56:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-16 15:56:42,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:56:42,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818542254] [2024-11-16 15:56:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818542254] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:56:42,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103823884] [2024-11-16 15:56:42,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:42,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:56:42,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:56:42,499 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 15:56:42,503 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 15:56:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:42,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 15:56:42,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 476 proven. 63 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-16 15:56:43,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:56:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 51 proven. 66 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-11-16 15:56:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103823884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:56:43,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 15:56:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-11-16 15:56:43,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552268129] [2024-11-16 15:56:43,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 15:56:43,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 15:56:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:56:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 15:56:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-16 15:56:43,521 INFO L87 Difference]: Start difference. First operand 619 states and 887 transitions. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 5 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-16 15:56:44,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:44,429 INFO L93 Difference]: Finished difference Result 816 states and 1159 transitions. [2024-11-16 15:56:44,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-16 15:56:44,430 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 5 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 147 [2024-11-16 15:56:44,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:44,432 INFO L225 Difference]: With dead ends: 816 [2024-11-16 15:56:44,432 INFO L226 Difference]: Without dead ends: 223 [2024-11-16 15:56:44,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=385, Invalid=1421, Unknown=0, NotChecked=0, Total=1806 [2024-11-16 15:56:44,435 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 639 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 15:56:44,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 575 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 15:56:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-16 15:56:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 165. [2024-11-16 15:56:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 112 states have internal predecessors, (134), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-16 15:56:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2024-11-16 15:56:44,466 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 147 [2024-11-16 15:56:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:44,466 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2024-11-16 15:56:44,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 5 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-16 15:56:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2024-11-16 15:56:44,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-16 15:56:44,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:44,468 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:44,486 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 15:56:44,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 15:56:44,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:44,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:44,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1542706685, now seen corresponding path program 1 times [2024-11-16 15:56:44,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:56:44,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036788770] [2024-11-16 15:56:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:44,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:56:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:56:44,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333375803] [2024-11-16 15:56:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:44,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:56:44,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:56:44,790 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 15:56:44,794 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 15:56:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:56:45,039 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:56:45,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:56:45,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:56:45,234 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:56:45,235 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:56:45,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 15:56:45,437 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,SelfDestructingSolverStorable6 [2024-11-16 15:56:45,442 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:56:45,545 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:56:45,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:56:45 BoogieIcfgContainer [2024-11-16 15:56:45,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:56:45,548 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:56:45,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:56:45,549 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:56:45,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:35" (3/4) ... [2024-11-16 15:56:45,551 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:56:45,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:56:45,552 INFO L158 Benchmark]: Toolchain (without parser) took 11411.25ms. Allocated memory was 165.7MB in the beginning and 343.9MB in the end (delta: 178.3MB). Free memory was 106.9MB in the beginning and 115.4MB in the end (delta: -8.5MB). Peak memory consumption was 171.6MB. Max. memory is 16.1GB. [2024-11-16 15:56:45,553 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:56:45,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.47ms. Allocated memory is still 165.7MB. Free memory was 106.6MB in the beginning and 88.5MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 15:56:45,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.95ms. Allocated memory is still 165.7MB. Free memory was 88.5MB in the beginning and 83.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 15:56:45,553 INFO L158 Benchmark]: Boogie Preprocessor took 107.10ms. Allocated memory is still 165.7MB. Free memory was 83.1MB in the beginning and 76.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 15:56:45,554 INFO L158 Benchmark]: IcfgBuilder took 783.86ms. Allocated memory was 165.7MB in the beginning and 237.0MB in the end (delta: 71.3MB). Free memory was 76.8MB in the beginning and 181.6MB in the end (delta: -104.7MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-16 15:56:45,554 INFO L158 Benchmark]: TraceAbstraction took 10055.14ms. Allocated memory was 237.0MB in the beginning and 343.9MB in the end (delta: 107.0MB). Free memory was 180.5MB in the beginning and 115.4MB in the end (delta: 65.1MB). Peak memory consumption was 172.0MB. Max. memory is 16.1GB. [2024-11-16 15:56:45,554 INFO L158 Benchmark]: Witness Printer took 3.66ms. Allocated memory is still 343.9MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:56:45,555 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.47ms. Allocated memory is still 165.7MB. Free memory was 106.6MB in the beginning and 88.5MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.95ms. Allocated memory is still 165.7MB. Free memory was 88.5MB in the beginning and 83.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.10ms. Allocated memory is still 165.7MB. Free memory was 83.1MB in the beginning and 76.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 783.86ms. Allocated memory was 165.7MB in the beginning and 237.0MB in the end (delta: 71.3MB). Free memory was 76.8MB in the beginning and 181.6MB in the end (delta: -104.7MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10055.14ms. Allocated memory was 237.0MB in the beginning and 343.9MB in the end (delta: 107.0MB). Free memory was 180.5MB in the beginning and 115.4MB in the end (delta: 65.1MB). Peak memory consumption was 172.0MB. Max. memory is 16.1GB. * Witness Printer took 3.66ms. Allocated memory is still 343.9MB. Free memory is still 115.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someUnaryFLOAToperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] signed char var_1_7 = -25; [L24] signed char var_1_9 = 50; [L25] signed char var_1_10 = -128; [L26] signed char var_1_11 = 0; [L27] signed char var_1_12 = -32; [L28] signed long int var_1_13 = 16; [L29] unsigned char var_1_14 = 1; [L30] unsigned long int var_1_15 = 16; [L31] unsigned char var_1_18 = 0; [L32] unsigned char var_1_19 = 0; [L33] unsigned char var_1_20 = 0; [L34] float var_1_21 = 127.25; [L35] float var_1_23 = 1.5; [L36] float var_1_24 = 100.5; [L37] signed char var_1_25 = 0; [L38] signed char var_1_26 = -2; [L39] signed char var_1_27 = 0; [L40] signed long int var_1_28 = -128; [L41] float var_1_30 = 9.375; [L42] double var_1_31 = 99999999.875; [L43] double var_1_32 = 4.8; [L44] unsigned short int var_1_33 = 0; [L45] unsigned short int var_1_35 = 54252; [L46] unsigned short int var_1_37 = 5; [L47] unsigned char var_1_38 = 4; [L48] signed char var_1_39 = -64; [L49] signed char last_1_var_1_10 = -128; [L50] unsigned char last_1_var_1_18 = 0; [L51] signed char last_1_var_1_25 = 0; [L52] unsigned short int last_1_var_1_33 = 0; [L53] signed char last_1_var_1_39 = -64; VAL [isInitial=0, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=50] [L183] isInitial = 1 [L184] FCALL initially() [L185] int k_loop; [L186] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=50] [L186] COND TRUE k_loop < 1 [L187] CALL updateLastVariables() [L172] last_1_var_1_10 = var_1_10 [L173] last_1_var_1_18 = var_1_18 [L174] last_1_var_1_25 = var_1_25 [L175] last_1_var_1_33 = var_1_33 [L176] last_1_var_1_39 = var_1_39 VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=50] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L137] var_1_9 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_9 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L138] RET assume_abort_if_not(var_1_9 >= -127) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L139] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L139] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L140] var_1_11 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L141] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L142] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L142] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=16, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L143] var_1_13 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L144] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L145] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L145] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L146] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L146] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L147] var_1_19 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L148] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L149] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L149] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L152] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L152] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_23=3/2, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L153] var_1_23 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L154] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_24=201/2, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L155] var_1_24 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L156] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-2, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L157] var_1_26 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_26 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L158] RET assume_abort_if_not(var_1_26 >= -63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L159] CALL assume_abort_if_not(var_1_26 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L159] RET assume_abort_if_not(var_1_26 <= 63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=0, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L160] var_1_27 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L161] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L162] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L162] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_31=799999999/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L163] var_1_31 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L164] RET assume_abort_if_not((var_1_31 >= 0.0F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_32=24/5, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L165] var_1_32 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L166] RET assume_abort_if_not((var_1_32 >= 0.0F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=54252, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L167] var_1_35 = __VERIFIER_nondet_ushort() [L168] CALL assume_abort_if_not(var_1_35 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L168] RET assume_abort_if_not(var_1_35 >= 49150) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L169] CALL assume_abort_if_not(var_1_35 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L169] RET assume_abort_if_not(var_1_35 <= 65534) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L188] RET updateVariables() [L189] CALL step() [L57] unsigned char stepLocal_3 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_3=0, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L58] COND FALSE !(stepLocal_3 || var_1_20) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L61] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=0, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L65] var_1_18 = (! (var_1_19 || var_1_20)) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L66] COND TRUE (- var_1_24) < var_1_23 [L67] var_1_25 = (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=5, var_1_38=4, var_1_39=-64, var_1_7=-25, var_1_9=-24] [L69] var_1_37 = var_1_11 [L70] var_1_38 = var_1_11 [L71] var_1_39 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-25, var_1_9=-24] [L72] COND TRUE \read(var_1_18) [L73] var_1_7 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L75] signed char stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_1=-24, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L76] COND FALSE !((last_1_var_1_10 + var_1_7) > stepLocal_1) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-32, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L79] COND TRUE (var_1_7 / var_1_13) == var_1_25 [L80] var_1_12 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=509/4, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L88] COND TRUE (var_1_11 - var_1_37) != -256 [L89] var_1_21 = ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L93] signed long int stepLocal_4 = var_1_28; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=75/8, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L94] COND TRUE ((var_1_31 - var_1_32) + var_1_24) != var_1_23 [L95] var_1_30 = ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=0, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L101] COND TRUE var_1_28 < var_1_37 [L102] var_1_33 = (((26262 - var_1_11) + 18571) - var_1_38) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L122] signed long int stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_0=-128, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L123] COND TRUE stepLocal_0 >= (var_1_37 * (10u * var_1_33)) [L124] var_1_1 = (var_1_10 + var_1_10) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L128] unsigned long int stepLocal_2 = 1u; VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_2=1, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L129] COND FALSE !((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == stepLocal_2) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=16, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L132] COND TRUE var_1_1 <= var_1_33 [L133] var_1_15 = ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, stepLocal_4=-128, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L189] RET step() [L190] CALL, EXPR property() [L179] EXPR ((((((((((((var_1_28 >= (var_1_37 * (10u * var_1_33))) ? (var_1_1 == ((signed short int) (var_1_10 + var_1_10))) : (var_1_1 == ((signed short int) var_1_10))) && (var_1_18 ? (var_1_7 == ((signed char) var_1_9)) : 1)) && (((last_1_var_1_10 + var_1_7) > var_1_9) ? (var_1_10 == ((signed char) (1 - var_1_11))) : 1)) && (((var_1_7 / var_1_13) == var_1_25) ? (var_1_12 == ((signed char) var_1_9)) : ((var_1_13 >= var_1_11) ? (var_1_12 == ((signed char) var_1_11)) : (var_1_12 == ((signed char) var_1_9))))) && (((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == 1u) ? (var_1_14 == ((unsigned char) (! 0))) : 1)) && ((var_1_1 <= var_1_33) ? (var_1_15 == ((unsigned long int) ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37))))) : 1)) && (var_1_18 == ((unsigned char) (! (var_1_19 || var_1_20))))) && (((var_1_11 - var_1_37) != -256) ? (var_1_21 == ((float) ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24))))) : (var_1_21 == ((float) var_1_23)))) && (((- var_1_24) < var_1_23) ? (var_1_25 == ((signed char) (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27))) : 1)) && ((last_1_var_1_18 || var_1_20) ? (var_1_28 == ((signed long int) (((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) > (last_1_var_1_25)) ? ((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) : (last_1_var_1_25))))) : (var_1_20 ? (var_1_28 == ((signed long int) ((((last_1_var_1_33) > ((last_1_var_1_39 + last_1_var_1_25))) ? (last_1_var_1_33) : ((last_1_var_1_39 + last_1_var_1_25)))))) : 1))) && ((((var_1_31 - var_1_32) + var_1_24) != var_1_23) ? (var_1_30 == ((float) ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24))))) : ((var_1_28 <= var_1_10) ? (var_1_30 == ((float) var_1_23)) : 1))) && ((var_1_28 < var_1_37) ? (var_1_33 == ((unsigned short int) (((26262 - var_1_11) + 18571) - var_1_38))) : ((! var_1_18) ? ((var_1_10 != (var_1_38 & (var_1_11 - 32))) ? (var_1_33 == ((unsigned short int) ((((((var_1_35 - var_1_11) - var_1_38)) < (var_1_38)) ? (((var_1_35 - var_1_11) - var_1_38)) : (var_1_38))))) : (var_1_33 == ((unsigned short int) (var_1_35 - var_1_38)))) : ((128u > var_1_38) ? (((var_1_38 * var_1_38) == (var_1_38 & var_1_28)) ? (var_1_33 == ((unsigned short int) var_1_11)) : (var_1_33 == ((unsigned short int) ((((((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) < (var_1_38)) ? (((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) : (var_1_38)))))) : (var_1_33 == ((unsigned short int) var_1_38))))) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L179-L180] return (((((((((((((((var_1_28 >= (var_1_37 * (10u * var_1_33))) ? (var_1_1 == ((signed short int) (var_1_10 + var_1_10))) : (var_1_1 == ((signed short int) var_1_10))) && (var_1_18 ? (var_1_7 == ((signed char) var_1_9)) : 1)) && (((last_1_var_1_10 + var_1_7) > var_1_9) ? (var_1_10 == ((signed char) (1 - var_1_11))) : 1)) && (((var_1_7 / var_1_13) == var_1_25) ? (var_1_12 == ((signed char) var_1_9)) : ((var_1_13 >= var_1_11) ? (var_1_12 == ((signed char) var_1_11)) : (var_1_12 == ((signed char) var_1_9))))) && (((((((var_1_13) < (25u)) ? (var_1_13) : (25u))) + var_1_33) == 1u) ? (var_1_14 == ((unsigned char) (! 0))) : 1)) && ((var_1_1 <= var_1_33) ? (var_1_15 == ((unsigned long int) ((((var_1_11) > (var_1_37)) ? (var_1_11) : (var_1_37))))) : 1)) && (var_1_18 == ((unsigned char) (! (var_1_19 || var_1_20))))) && (((var_1_11 - var_1_37) != -256) ? (var_1_21 == ((float) ((((((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) < (var_1_24)) ? (((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) : (var_1_24))))) : (var_1_21 == ((float) var_1_23)))) && (((- var_1_24) < var_1_23) ? (var_1_25 == ((signed char) (((((-10) < (var_1_26)) ? (-10) : (var_1_26))) + var_1_27))) : 1)) && ((last_1_var_1_18 || var_1_20) ? (var_1_28 == ((signed long int) (((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) > (last_1_var_1_25)) ? ((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - (var_1_11 + last_1_var_1_33))) : (last_1_var_1_25))))) : (var_1_20 ? (var_1_28 == ((signed long int) ((((last_1_var_1_33) > ((last_1_var_1_39 + last_1_var_1_25))) ? (last_1_var_1_33) : ((last_1_var_1_39 + last_1_var_1_25)))))) : 1))) && ((((var_1_31 - var_1_32) + var_1_24) != var_1_23) ? (var_1_30 == ((float) ((((var_1_23) < (var_1_24)) ? (var_1_23) : (var_1_24))))) : ((var_1_28 <= var_1_10) ? (var_1_30 == ((float) var_1_23)) : 1))) && ((var_1_28 < var_1_37) ? (var_1_33 == ((unsigned short int) (((26262 - var_1_11) + 18571) - var_1_38))) : ((! var_1_18) ? ((var_1_10 != (var_1_38 & (var_1_11 - 32))) ? (var_1_33 == ((unsigned short int) ((((((var_1_35 - var_1_11) - var_1_38)) < (var_1_38)) ? (((var_1_35 - var_1_11) - var_1_38)) : (var_1_38))))) : (var_1_33 == ((unsigned short int) (var_1_35 - var_1_38)))) : ((128u > var_1_38) ? (((var_1_38 * var_1_38) == (var_1_38 & var_1_28)) ? (var_1_33 == ((unsigned short int) var_1_11)) : (var_1_33 == ((unsigned short int) ((((((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) < (var_1_38)) ? (((((var_1_11) > (var_1_35)) ? (var_1_11) : (var_1_35)))) : (var_1_38)))))) : (var_1_33 == ((unsigned short int) var_1_38)))))) && (var_1_37 == ((unsigned short int) var_1_11))) && (var_1_38 == ((unsigned char) var_1_11))) && (var_1_39 == ((signed char) var_1_11)) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-128, last_1_var_1_18=0, last_1_var_1_25=0, last_1_var_1_33=0, last_1_var_1_39=-64, var_1_10=-128, var_1_11=0, var_1_12=-24, var_1_13=25, var_1_14=1, var_1_15=0, var_1_18=1, var_1_19=0, var_1_1=-256, var_1_20=0, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=-63, var_1_27=63, var_1_28=-128, var_1_30=3, var_1_33=44833, var_1_35=49150, var_1_37=0, var_1_38=0, var_1_39=0, var_1_7=-24, var_1_9=-24] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2086 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2086 mSDsluCounter, 3045 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2236 mSDsCounter, 523 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1336 IncrementalHoareTripleChecker+Invalid, 1859 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 523 mSolverCounterUnsat, 809 mSDtfsCounter, 1336 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 647 GetRequests, 573 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=619occurred in iteration=5, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 521 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1325 NumberOfCodeBlocks, 1325 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1168 ConstructedInterpolants, 0 QuantifiedInterpolants, 4606 SizeOfPredicates, 3 NumberOfNonLiveVariables, 372 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 6561/6720 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 15:56:45,584 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_loopvsstraightlinecode_100-1loop_file-16.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 f7a7425e896251d765b196e2267bf51e4ef5d4f864eb4111189d282f80a6908b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:56:47,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:56:47,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:56:47,900 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:56:47,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:56:47,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:56:47,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:56:47,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:56:47,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:56:47,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:56:47,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:56:47,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:56:47,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:56:47,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:56:47,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:56:47,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:56:47,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:56:47,939 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:56:47,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:56:47,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:56:47,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:56:47,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:56:47,943 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:56:47,943 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:56:47,944 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:56:47,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:56:47,944 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:56:47,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:56:47,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:56:47,945 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:56:47,945 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:56:47,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:56:47,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:56:47,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:56:47,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:56:47,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:56:47,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:56:47,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:56:47,948 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:56:47,948 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:56:47,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:56:47,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:56:47,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:56:47,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:56:47,950 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 -> f7a7425e896251d765b196e2267bf51e4ef5d4f864eb4111189d282f80a6908b [2024-11-16 15:56:48,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:56:48,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:56:48,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:56:48,281 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:56:48,281 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:56:48,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-16 15:56:49,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:56:49,918 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:56:49,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-16 15:56:49,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c798a4d7/e6bfef38db4f4cccb497b4ce154b52c8/FLAGa788758ce [2024-11-16 15:56:49,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c798a4d7/e6bfef38db4f4cccb497b4ce154b52c8 [2024-11-16 15:56:49,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:56:49,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:56:49,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:56:49,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:56:49,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:56:49,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:49" (1/1) ... [2024-11-16 15:56:49,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1959eaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:49, skipping insertion in model container [2024-11-16 15:56:49,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:56:49" (1/1) ... [2024-11-16 15:56:49,996 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:56:50,196 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_loopvsstraightlinecode_100-1loop_file-16.i[916,929] [2024-11-16 15:56:50,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:56:50,302 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:56:50,313 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_loopvsstraightlinecode_100-1loop_file-16.i[916,929] [2024-11-16 15:56:50,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:56:50,372 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:56:50,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50 WrapperNode [2024-11-16 15:56:50,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:56:50,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:56:50,374 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:56:50,374 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:56:50,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,431 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-16 15:56:50,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:56:50,432 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:56:50,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:56:50,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:56:50,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,479 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 15:56:50,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:56:50,515 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:56:50,515 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:56:50,515 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:56:50,516 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (1/1) ... [2024-11-16 15:56:50,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:56:50,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:56:50,549 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:56:50,569 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 15:56:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:56:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:56:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:56:50,606 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:56:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:56:50,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:56:50,712 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:56:50,715 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:56:55,821 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-16 15:56:55,831 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:56:55,848 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:56:55,848 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:56:55,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:55 BoogieIcfgContainer [2024-11-16 15:56:55,849 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:56:55,851 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:56:55,851 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:56:55,855 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:56:55,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:56:49" (1/3) ... [2024-11-16 15:56:55,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebe9f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:55, skipping insertion in model container [2024-11-16 15:56:55,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:56:50" (2/3) ... [2024-11-16 15:56:55,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ebe9f2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:56:55, skipping insertion in model container [2024-11-16 15:56:55,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:56:55" (3/3) ... [2024-11-16 15:56:55,860 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-16 15:56:55,879 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:56:55,879 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:56:55,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:56:55,968 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;@455e6ee0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:56:55,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:56:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:56:55,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 15:56:55,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:55,989 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:55,989 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:55,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:55,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1008036518, now seen corresponding path program 1 times [2024-11-16 15:56:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:56:56,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913431714] [2024-11-16 15:56:56,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:56,012 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 15:56:56,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:56:56,016 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 15:56:56,017 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 15:56:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:56,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:56:56,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-11-16 15:56:56,436 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:56:56,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:56:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913431714] [2024-11-16 15:56:56,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [913431714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:56:56,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:56:56,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:56:56,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396897362] [2024-11-16 15:56:56,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:56:56,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:56:56,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:56:56,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:56:56,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:56:56,477 INFO L87 Difference]: Start difference. First operand has 79 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 56 states have internal predecessors, (78), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:56:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:56:56,513 INFO L93 Difference]: Finished difference Result 154 states and 257 transitions. [2024-11-16 15:56:56,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:56:56,516 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 145 [2024-11-16 15:56:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:56:56,524 INFO L225 Difference]: With dead ends: 154 [2024-11-16 15:56:56,525 INFO L226 Difference]: Without dead ends: 74 [2024-11-16 15:56:56,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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 15:56:56,531 INFO L432 NwaCegarLoop]: 116 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, 116 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 15:56:56,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:56:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-16 15:56:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-16 15:56:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 15:56:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-11-16 15:56:56,584 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 145 [2024-11-16 15:56:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:56:56,585 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-11-16 15:56:56,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-16 15:56:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-11-16 15:56:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 15:56:56,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:56:56,589 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:56:56,601 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 15:56:56,789 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 15:56:56,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:56:56,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:56:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1489664225, now seen corresponding path program 1 times [2024-11-16 15:56:56,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:56:56,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215693218] [2024-11-16 15:56:56,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:56:56,792 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 15:56:56,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:56:56,796 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 15:56:56,797 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 15:56:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:56:57,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 15:56:57,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:56:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-16 15:56:58,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:56:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-16 15:56:59,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:56:59,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215693218] [2024-11-16 15:56:59,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215693218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:56:59,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 15:56:59,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2024-11-16 15:56:59,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913721072] [2024-11-16 15:56:59,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 15:56:59,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 15:56:59,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:56:59,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 15:56:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 15:56:59,697 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-16 15:57:03,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:57:05,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:57:06,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:57:06,195 INFO L93 Difference]: Finished difference Result 302 states and 455 transitions. [2024-11-16 15:57:06,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 15:57:06,196 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 145 [2024-11-16 15:57:06,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:57:06,202 INFO L225 Difference]: With dead ends: 302 [2024-11-16 15:57:06,205 INFO L226 Difference]: Without dead ends: 231 [2024-11-16 15:57:06,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2024-11-16 15:57:06,209 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 325 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:57:06,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 543 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-16 15:57:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-16 15:57:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 188. [2024-11-16 15:57:06,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 133 states have (on average 1.3909774436090225) internal successors, (185), 134 states have internal predecessors, (185), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-16 15:57:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2024-11-16 15:57:06,253 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 287 transitions. Word has length 145 [2024-11-16 15:57:06,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:57:06,255 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 287 transitions. [2024-11-16 15:57:06,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 2 states have call successors, (42), 3 states have call predecessors, (42), 5 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-16 15:57:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 287 transitions. [2024-11-16 15:57:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 15:57:06,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:57:06,260 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:57:06,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 15:57:06,460 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 15:57:06,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:57:06,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:57:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash 598010178, now seen corresponding path program 1 times [2024-11-16 15:57:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:57:06,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574211383] [2024-11-16 15:57:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:57:06,462 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 15:57:06,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:57:06,465 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 15:57:06,466 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 15:57:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:57:06,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 15:57:06,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:57:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:57:06,893 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:57:06,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:57:06,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574211383] [2024-11-16 15:57:06,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574211383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:57:06,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:57:06,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 15:57:06,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612465037] [2024-11-16 15:57:06,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:57:06,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 15:57:06,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:57:06,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 15:57:06,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 15:57:06,899 INFO L87 Difference]: Start difference. First operand 188 states and 287 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:57:08,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 15:57:11,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 15:57:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:57:12,234 INFO L93 Difference]: Finished difference Result 588 states and 881 transitions. [2024-11-16 15:57:12,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:57:12,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 146 [2024-11-16 15:57:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:57:12,241 INFO L225 Difference]: With dead ends: 588 [2024-11-16 15:57:12,242 INFO L226 Difference]: Without dead ends: 403 [2024-11-16 15:57:12,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 15:57:12,244 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 160 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-16 15:57:12,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 520 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-16 15:57:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-16 15:57:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 294. [2024-11-16 15:57:12,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 200 states have (on average 1.285) internal successors, (257), 204 states have internal predecessors, (257), 83 states have call successors, (83), 10 states have call predecessors, (83), 10 states have return successors, (83), 79 states have call predecessors, (83), 83 states have call successors, (83) [2024-11-16 15:57:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 423 transitions. [2024-11-16 15:57:12,307 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 423 transitions. Word has length 146 [2024-11-16 15:57:12,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:57:12,308 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 423 transitions. [2024-11-16 15:57:12,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:57:12,308 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 423 transitions. [2024-11-16 15:57:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 15:57:12,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:57:12,314 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:57:12,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 15:57:12,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:57:12,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:57:12,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:57:12,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1485513859, now seen corresponding path program 1 times [2024-11-16 15:57:12,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:57:12,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197121961] [2024-11-16 15:57:12,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:57:12,517 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 15:57:12,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:57:12,520 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:57:12,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 15:57:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:57:12,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 15:57:12,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:57:13,789 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-16 15:57:13,790 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:57:13,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:57:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197121961] [2024-11-16 15:57:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197121961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:57:13,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:57:13,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 15:57:13,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910302943] [2024-11-16 15:57:13,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:57:13,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:57:13,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:57:13,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:57:13,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:57:13,792 INFO L87 Difference]: Start difference. First operand 294 states and 423 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:57:17,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:57:18,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 15:57:18,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:57:18,762 INFO L93 Difference]: Finished difference Result 960 states and 1377 transitions. [2024-11-16 15:57:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:57:18,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 146 [2024-11-16 15:57:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:57:18,807 INFO L225 Difference]: With dead ends: 960 [2024-11-16 15:57:18,807 INFO L226 Difference]: Without dead ends: 674 [2024-11-16 15:57:18,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:57:18,810 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 176 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-16 15:57:18,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 442 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-16 15:57:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-16 15:57:18,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 503. [2024-11-16 15:57:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 352 states have (on average 1.3068181818181819) internal successors, (460), 357 states have internal predecessors, (460), 134 states have call successors, (134), 16 states have call predecessors, (134), 16 states have return successors, (134), 129 states have call predecessors, (134), 134 states have call successors, (134) [2024-11-16 15:57:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 728 transitions. [2024-11-16 15:57:18,894 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 728 transitions. Word has length 146 [2024-11-16 15:57:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:57:18,894 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 728 transitions. [2024-11-16 15:57:18,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-16 15:57:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 728 transitions. [2024-11-16 15:57:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 15:57:18,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:57:18,899 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:57:18,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 15:57:19,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 15:57:19,100 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:57:19,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:57:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash 974979682, now seen corresponding path program 1 times [2024-11-16 15:57:19,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:57:19,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030534369] [2024-11-16 15:57:19,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:57:19,101 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 15:57:19,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:57:19,104 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 15:57:19,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 15:57:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:57:19,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-16 15:57:19,420 INFO L278 TraceCheckSpWp]: Computing forward predicates...