./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 023d838f 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-023d838-m [2024-11-10 07:00:12,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:00:12,438 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:00:12,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:00:12,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:00:12,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:00:12,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:00:12,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:00:12,462 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:00:12,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:00:12,464 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:00:12,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:00:12,465 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:00:12,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:00:12,466 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:00:12,467 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:00:12,467 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:00:12,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:00:12,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:00:12,468 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:00:12,468 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:00:12,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:00:12,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:00:12,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:00:12,471 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:00:12,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:00:12,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:00:12,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:00:12,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:00:12,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:00:12,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:00:12,473 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:00:12,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:00:12,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:00:12,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:00:12,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:00:12,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:00:12,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:00:12,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:00:12,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:00:12,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:00:12,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:00:12,476 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-10 07:00:12,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:00:12,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:00:12,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:00:12,773 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:00:12,773 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:00:12,774 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-10 07:00:14,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:00:14,405 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:00:14,406 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-10 07:00:14,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ffa486a/a5949eff1b9443b8a541539749b19b8b/FLAG49e6cc5e5 [2024-11-10 07:00:14,435 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83ffa486a/a5949eff1b9443b8a541539749b19b8b [2024-11-10 07:00:14,437 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:00:14,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:00:14,444 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:00:14,444 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:00:14,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:00:14,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:14,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7ace74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14, skipping insertion in model container [2024-11-10 07:00:14,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:14,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:00:14,658 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-10 07:00:14,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:00:14,824 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:00:14,851 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-10 07:00:14,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:00:14,974 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:00:14,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14 WrapperNode [2024-11-10 07:00:14,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:00:14,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:00:14,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:00:14,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:00:14,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,038 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-11-10 07:00:15,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:00:15,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:00:15,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:00:15,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:00:15,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,076 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-10 07:00:15,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,101 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:00:15,123 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:00:15,123 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:00:15,123 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:00:15,124 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (1/1) ... [2024-11-10 07:00:15,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:00:15,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:00:15,161 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-10 07:00:15,168 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-10 07:00:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:00:15,215 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:00:15,216 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:00:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:00:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:00:15,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:00:15,318 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:00:15,321 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:00:15,822 INFO L1247 $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-10 07:00:15,866 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-10 07:00:15,867 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:00:15,893 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:00:15,893 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:00:15,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:00:15 BoogieIcfgContainer [2024-11-10 07:00:15,894 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:00:15,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:00:15,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:00:15,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:00:15,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:00:14" (1/3) ... [2024-11-10 07:00:15,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69185758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:00:15, skipping insertion in model container [2024-11-10 07:00:15,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:14" (2/3) ... [2024-11-10 07:00:15,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69185758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:00:15, skipping insertion in model container [2024-11-10 07:00:15,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:00:15" (3/3) ... [2024-11-10 07:00:15,907 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-10 07:00:15,924 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:00:15,926 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:00:15,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:00:16,000 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;@5cb77576, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:00:16,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:00:16,006 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-10 07:00:16,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:00:16,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:00:16,019 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-10 07:00:16,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:00:16,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:00:16,024 INFO L85 PathProgramCache]: Analyzing trace with hash -599690628, now seen corresponding path program 1 times [2024-11-10 07:00:16,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:00:16,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036992583] [2024-11-10 07:00:16,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:16,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:00:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:00:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:00:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:00:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:00:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:00:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:00:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:00:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:00:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:00:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:00:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:00:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:00:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:00:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:00:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:00:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:00:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:00:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:00:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:00:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:00:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:00:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:16,559 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-10 07:00:16,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:00:16,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036992583] [2024-11-10 07:00:16,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036992583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:00:16,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:00:16,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:00:16,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876127830] [2024-11-10 07:00:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:00:16,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:00:16,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:00:16,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:00:16,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:00:16,602 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-10 07:00:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:00:16,648 INFO L93 Difference]: Finished difference Result 198 states and 325 transitions. [2024-11-10 07:00:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:00:16,652 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-10 07:00:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:00:16,665 INFO L225 Difference]: With dead ends: 198 [2024-11-10 07:00:16,666 INFO L226 Difference]: Without dead ends: 96 [2024-11-10 07:00:16,669 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-10 07:00:16,672 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-10 07:00:16,673 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-10 07:00:16,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-10 07:00:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-10 07:00:16,722 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-10 07:00:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-11-10 07:00:16,728 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 147 [2024-11-10 07:00:16,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:00:16,728 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-11-10 07:00:16,729 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-10 07:00:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-11-10 07:00:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:00:16,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:00:16,733 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-10 07:00:16,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:00:16,734 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:00:16,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:00:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash 412550913, now seen corresponding path program 1 times [2024-11-10 07:00:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:00:16,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113538676] [2024-11-10 07:00:16,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:16,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:00:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:00:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:00:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:00:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:00:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:00:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:00:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:00:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:00:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:00:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:00:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:00:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:00:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:00:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:00:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:00:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:00:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:00:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:00:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:00:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:00:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:00:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:17,398 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-10 07:00:17,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:00:17,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113538676] [2024-11-10 07:00:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113538676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:00:17,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:00:17,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 07:00:17,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716604105] [2024-11-10 07:00:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:00:17,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:00:17,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:00:17,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:00:17,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:00:17,406 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-10 07:00:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:00:17,932 INFO L93 Difference]: Finished difference Result 378 states and 579 transitions. [2024-11-10 07:00:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:00:17,932 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-10 07:00:17,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:00:17,936 INFO L225 Difference]: With dead ends: 378 [2024-11-10 07:00:17,936 INFO L226 Difference]: Without dead ends: 285 [2024-11-10 07:00:17,937 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-10 07:00:17,938 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 405 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-10 07:00:17,939 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-10 07:00:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-10 07:00:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 188. [2024-11-10 07:00:17,969 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-10 07:00:17,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 289 transitions. [2024-11-10 07:00:17,971 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 289 transitions. Word has length 147 [2024-11-10 07:00:17,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:00:17,972 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 289 transitions. [2024-11-10 07:00:17,972 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-10 07:00:17,972 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 289 transitions. [2024-11-10 07:00:17,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:00:17,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:00:17,975 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-10 07:00:17,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:00:17,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:00:17,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:00:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash -584521440, now seen corresponding path program 1 times [2024-11-10 07:00:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:00:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566888926] [2024-11-10 07:00:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:00:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:00:18,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:00:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:00:18,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:00:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:00:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:00:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:00:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:00:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:00:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:00:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:00:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:00:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:00:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:00:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:00:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:00:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:00:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:00:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:00:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:00:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:00:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:18,764 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-10 07:00:18,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:00:18,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566888926] [2024-11-10 07:00:18,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566888926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:00:18,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:00:18,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:00:18,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597428358] [2024-11-10 07:00:18,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:00:18,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:00:18,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:00:18,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:00:18,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:00:18,769 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-10 07:00:19,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:00:19,117 INFO L93 Difference]: Finished difference Result 744 states and 1140 transitions. [2024-11-10 07:00:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:00:19,118 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-10 07:00:19,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:00:19,126 INFO L225 Difference]: With dead ends: 744 [2024-11-10 07:00:19,126 INFO L226 Difference]: Without dead ends: 559 [2024-11-10 07:00:19,132 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-10 07:00:19,133 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-10 07:00:19,133 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-10 07:00:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-10 07:00:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 367. [2024-11-10 07:00:19,203 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-10 07:00:19,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 555 transitions. [2024-11-10 07:00:19,208 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 555 transitions. Word has length 147 [2024-11-10 07:00:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:00:19,209 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 555 transitions. [2024-11-10 07:00:19,209 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-10 07:00:19,211 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 555 transitions. [2024-11-10 07:00:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:00:19,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:00:19,218 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-10 07:00:19,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:00:19,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:00:19,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:00:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash 3726688, now seen corresponding path program 1 times [2024-11-10 07:00:19,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:00:19,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363531240] [2024-11-10 07:00:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:19,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:00:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:00:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:00:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:00:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:00:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:00:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:00:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:00:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:00:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:00:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:00:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:00:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:00:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:00:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:00:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:00:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:00:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:00:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:00:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:00:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:00:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:00:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:19,517 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-10 07:00:19,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:00:19,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363531240] [2024-11-10 07:00:19,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363531240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:00:19,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:00:19,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 07:00:19,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414384591] [2024-11-10 07:00:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:00:19,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:00:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:00:19,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:00:19,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:00:19,520 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-10 07:00:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:00:19,916 INFO L93 Difference]: Finished difference Result 717 states and 1083 transitions. [2024-11-10 07:00:19,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:00:19,917 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-10 07:00:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:00:19,923 INFO L225 Difference]: With dead ends: 717 [2024-11-10 07:00:19,925 INFO L226 Difference]: Without dead ends: 542 [2024-11-10 07:00:19,927 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-10 07:00:19,928 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-10 07:00:19,931 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-10 07:00:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-10 07:00:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 539. [2024-11-10 07:00:19,988 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-10 07:00:19,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 815 transitions. [2024-11-10 07:00:19,993 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 815 transitions. Word has length 147 [2024-11-10 07:00:19,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:00:19,996 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 815 transitions. [2024-11-10 07:00:19,996 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-10 07:00:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 815 transitions. [2024-11-10 07:00:19,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:00:19,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:00:19,998 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-10 07:00:19,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:00:19,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:00:20,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:00:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash -993345665, now seen corresponding path program 1 times [2024-11-10 07:00:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:00:20,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989092738] [2024-11-10 07:00:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:00:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:00:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:00:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:00:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:00:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:00:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:00:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:00:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:00:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:00:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:00:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:00:21,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:00:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:00:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:00:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:00:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:00:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:00:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:00:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:00:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:00:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:00:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:21,622 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-10 07:00:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:00:21,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989092738] [2024-11-10 07:00:21,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989092738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:00:21,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:00:21,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 07:00:21,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111785201] [2024-11-10 07:00:21,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:00:21,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:00:21,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:00:21,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:00:21,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:00:21,625 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-10 07:00:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:00:22,531 INFO L93 Difference]: Finished difference Result 1311 states and 1905 transitions. [2024-11-10 07:00:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 07:00:22,532 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-10 07:00:22,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:00:22,538 INFO L225 Difference]: With dead ends: 1311 [2024-11-10 07:00:22,538 INFO L226 Difference]: Without dead ends: 790 [2024-11-10 07:00:22,540 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-10 07:00:22,540 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-10 07:00:22,541 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-10 07:00:22,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-10 07:00:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 619. [2024-11-10 07:00:22,635 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-10 07:00:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 887 transitions. [2024-11-10 07:00:22,639 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 887 transitions. Word has length 147 [2024-11-10 07:00:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:00:22,640 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 887 transitions. [2024-11-10 07:00:22,640 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-10 07:00:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 887 transitions. [2024-11-10 07:00:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-10 07:00:22,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:00:22,641 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-10 07:00:22,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 07:00:22,642 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:00:22,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:00:22,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1494167168, now seen corresponding path program 1 times [2024-11-10 07:00:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:00:22,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900475603] [2024-11-10 07:00:22,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:00:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:22,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:00:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:00:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:00:23,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:00:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:00:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:00:23,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:00:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:00:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 07:00:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:00:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 07:00:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:00:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:00:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:00:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:00:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:00:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 07:00:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 07:00:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 07:00:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:00:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 07:00:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,098 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-10 07:00:23,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:00:23,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900475603] [2024-11-10 07:00:23,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900475603] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:00:23,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486021242] [2024-11-10 07:00:23,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:23,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:00:23,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:00:23,102 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-10 07:00:23,103 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-10 07:00:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:23,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 07:00:23,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:00:23,717 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-10 07:00:23,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:00:24,102 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-10 07:00:24,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486021242] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:00:24,103 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:00:24,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-11-10 07:00:24,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011766217] [2024-11-10 07:00:24,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:00:24,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 07:00:24,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:00:24,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 07:00:24,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-10 07:00:24,108 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-10 07:00:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:00:25,007 INFO L93 Difference]: Finished difference Result 816 states and 1159 transitions. [2024-11-10 07:00:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-10 07:00:25,008 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-10 07:00:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:00:25,011 INFO L225 Difference]: With dead ends: 816 [2024-11-10 07:00:25,011 INFO L226 Difference]: Without dead ends: 223 [2024-11-10 07:00:25,013 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-10 07:00:25,013 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-10 07:00:25,014 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-10 07:00:25,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-10 07:00:25,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 165. [2024-11-10 07:00:25,048 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-10 07:00:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 218 transitions. [2024-11-10 07:00:25,050 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 218 transitions. Word has length 147 [2024-11-10 07:00:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:00:25,051 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 218 transitions. [2024-11-10 07:00:25,052 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-10 07:00:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 218 transitions. [2024-11-10 07:00:25,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-10 07:00:25,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:00:25,054 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-10 07:00:25,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 07:00:25,258 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-10 07:00:25,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:00:25,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:00:25,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1542706685, now seen corresponding path program 1 times [2024-11-10 07:00:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:00:25,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466006304] [2024-11-10 07:00:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:00:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:00:25,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108505826] [2024-11-10 07:00:25,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:25,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:00:25,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:00:25,357 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-10 07:00:25,377 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-10 07:00:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:00:25,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:00:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:00:25,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:00:25,803 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:00:25,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:00:25,827 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-10 07:00:26,006 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-10 07:00:26,010 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:00:26,121 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:00:26,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:00:26 BoogieIcfgContainer [2024-11-10 07:00:26,124 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:00:26,125 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:00:26,125 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:00:26,125 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:00:26,125 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:00:15" (3/4) ... [2024-11-10 07:00:26,128 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:00:26,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:00:26,129 INFO L158 Benchmark]: Toolchain (without parser) took 11688.45ms. Allocated memory was 184.5MB in the beginning and 297.8MB in the end (delta: 113.2MB). Free memory was 120.9MB in the beginning and 219.8MB in the end (delta: -98.9MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-10 07:00:26,130 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:00:26,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.49ms. Allocated memory is still 184.5MB. Free memory was 120.9MB in the beginning and 147.5MB in the end (delta: -26.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 07:00:26,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.63ms. Allocated memory is still 184.5MB. Free memory was 147.5MB in the beginning and 142.1MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:00:26,130 INFO L158 Benchmark]: Boogie Preprocessor took 82.83ms. Allocated memory is still 184.5MB. Free memory was 142.1MB in the beginning and 135.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:00:26,131 INFO L158 Benchmark]: IcfgBuilder took 770.96ms. Allocated memory is still 184.5MB. Free memory was 135.8MB in the beginning and 102.2MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 07:00:26,131 INFO L158 Benchmark]: TraceAbstraction took 10226.41ms. Allocated memory was 184.5MB in the beginning and 297.8MB in the end (delta: 113.2MB). Free memory was 101.3MB in the beginning and 219.8MB in the end (delta: -118.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:00:26,131 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 297.8MB. Free memory is still 219.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:00:26,132 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 96.5MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.49ms. Allocated memory is still 184.5MB. Free memory was 120.9MB in the beginning and 147.5MB in the end (delta: -26.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.63ms. Allocated memory is still 184.5MB. Free memory was 147.5MB in the beginning and 142.1MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.83ms. Allocated memory is still 184.5MB. Free memory was 142.1MB in the beginning and 135.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 770.96ms. Allocated memory is still 184.5MB. Free memory was 135.8MB in the beginning and 102.2MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10226.41ms. Allocated memory was 184.5MB in the beginning and 297.8MB in the end (delta: 113.2MB). Free memory was 101.3MB in the beginning and 219.8MB in the end (delta: -118.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 297.8MB. Free memory is still 219.8MB. 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: 10.0s, OverallIterations: 7, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, 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.6s 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-10 07:00:26,166 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-023d838-m [2024-11-10 07:00:28,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:00:28,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:00:28,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:00:28,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:00:28,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:00:28,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:00:28,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:00:28,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:00:28,517 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:00:28,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:00:28,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:00:28,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:00:28,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:00:28,519 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:00:28,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:00:28,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:00:28,521 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:00:28,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:00:28,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:00:28,522 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:00:28,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:00:28,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:00:28,526 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:00:28,526 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:00:28,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:00:28,527 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:00:28,527 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:00:28,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:00:28,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:00:28,528 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:00:28,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:00:28,531 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:00:28,531 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:00:28,531 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:00:28,532 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:00:28,532 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:00:28,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:00:28,532 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:00:28,532 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:00:28,533 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:00:28,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:00:28,534 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:00:28,534 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:00:28,535 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-10 07:00:28,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:00:28,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:00:28,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:00:28,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:00:28,908 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:00:28,909 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-10 07:00:30,461 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:00:30,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:00:30,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-10 07:00:30,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7745cd056/c06448e4d8ad48758c1aa6791a5578c8/FLAGafda35ffc [2024-11-10 07:00:30,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7745cd056/c06448e4d8ad48758c1aa6791a5578c8 [2024-11-10 07:00:30,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:00:30,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:00:30,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:00:30,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:00:30,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:00:30,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:00:30" (1/1) ... [2024-11-10 07:00:30,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c665b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:30, skipping insertion in model container [2024-11-10 07:00:30,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:00:30" (1/1) ... [2024-11-10 07:00:30,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:00:30,971 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-10 07:00:31,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:00:31,113 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:00:31,126 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-10 07:00:31,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:00:31,199 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:00:31,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31 WrapperNode [2024-11-10 07:00:31,200 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:00:31,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:00:31,201 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:00:31,201 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:00:31,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,264 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2024-11-10 07:00:31,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:00:31,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:00:31,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:00:31,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:00:31,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,307 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-10 07:00:31,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,319 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,325 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:00:31,335 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:00:31,335 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:00:31,335 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:00:31,336 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (1/1) ... [2024-11-10 07:00:31,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:00:31,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:00:31,382 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-10 07:00:31,389 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-10 07:00:31,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:00:31,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:00:31,429 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:00:31,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:00:31,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:00:31,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:00:31,525 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:00:31,527 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:00:36,879 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-10 07:00:36,879 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:00:36,891 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:00:36,892 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:00:36,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:00:36 BoogieIcfgContainer [2024-11-10 07:00:36,892 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:00:36,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:00:36,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:00:36,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:00:36,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:00:30" (1/3) ... [2024-11-10 07:00:36,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6597f613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:00:36, skipping insertion in model container [2024-11-10 07:00:36,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:00:31" (2/3) ... [2024-11-10 07:00:36,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6597f613 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:00:36, skipping insertion in model container [2024-11-10 07:00:36,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:00:36" (3/3) ... [2024-11-10 07:00:36,900 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-10 07:00:36,916 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:00:36,917 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:00:36,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:00:36,991 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;@5cc073e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:00:36,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:00:36,996 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-10 07:00:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:00:37,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:00:37,014 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-10 07:00:37,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:00:37,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:00:37,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1008036518, now seen corresponding path program 1 times [2024-11-10 07:00:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:00:37,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742357101] [2024-11-10 07:00:37,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:37,038 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-10 07:00:37,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:00:37,041 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-10 07:00:37,043 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-10 07:00:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:37,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:00:37,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:00:37,454 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-10 07:00:37,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:00:37,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:00:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742357101] [2024-11-10 07:00:37,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742357101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:00:37,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:00:37,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:00:37,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160534821] [2024-11-10 07:00:37,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:00:37,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:00:37,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:00:37,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:00:37,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:00:37,484 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-10 07:00:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:00:37,509 INFO L93 Difference]: Finished difference Result 154 states and 257 transitions. [2024-11-10 07:00:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:00:37,512 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-10 07:00:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:00:37,519 INFO L225 Difference]: With dead ends: 154 [2024-11-10 07:00:37,520 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 07:00:37,524 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-10 07:00:37,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-10 07:00:37,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-10 07:00:37,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 07:00:37,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-10 07:00:37,575 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-10 07:00:37,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-11-10 07:00:37,579 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 145 [2024-11-10 07:00:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:00:37,579 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-11-10 07:00:37,580 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-10 07:00:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-11-10 07:00:37,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-10 07:00:37,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:00:37,583 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-10 07:00:37,593 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-10 07:00:37,783 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-10 07:00:37,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:00:37,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:00:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1489664225, now seen corresponding path program 1 times [2024-11-10 07:00:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:00:37,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591191387] [2024-11-10 07:00:37,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:37,786 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-10 07:00:37,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:00:37,788 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-10 07:00:37,789 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-10 07:00:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:38,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 07:00:38,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:00:39,635 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-10 07:00:39,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:00:40,544 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-10 07:00:40,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:00:40,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591191387] [2024-11-10 07:00:40,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591191387] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:00:40,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:00:40,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2024-11-10 07:00:40,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796521087] [2024-11-10 07:00:40,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:00:40,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:00:40,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:00:40,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:00:40,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:00:40,551 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-10 07:00:44,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:00:45,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:00:47,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:00:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:00:48,284 INFO L93 Difference]: Finished difference Result 302 states and 455 transitions. [2024-11-10 07:00:48,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 07:00:48,286 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-10 07:00:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:00:48,289 INFO L225 Difference]: With dead ends: 302 [2024-11-10 07:00:48,289 INFO L226 Difference]: Without dead ends: 231 [2024-11-10 07:00:48,292 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-10 07:00:48,293 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 325 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s 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, 7.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:00:48,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 543 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-10 07:00:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-10 07:00:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 188. [2024-11-10 07:00:48,332 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-10 07:00:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2024-11-10 07:00:48,337 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 287 transitions. Word has length 145 [2024-11-10 07:00:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:00:48,338 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 287 transitions. [2024-11-10 07:00:48,339 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-10 07:00:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 287 transitions. [2024-11-10 07:00:48,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:00:48,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:00:48,342 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-10 07:00:48,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 07:00:48,542 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-10 07:00:48,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:00:48,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:00:48,543 INFO L85 PathProgramCache]: Analyzing trace with hash 598010178, now seen corresponding path program 1 times [2024-11-10 07:00:48,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:00:48,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263640042] [2024-11-10 07:00:48,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:48,545 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-10 07:00:48,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:00:48,548 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-10 07:00:48,549 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-10 07:00:48,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:48,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:00:48,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:00:49,051 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-10 07:00:49,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:00:49,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:00:49,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263640042] [2024-11-10 07:00:49,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263640042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:00:49,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:00:49,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:00:49,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399543421] [2024-11-10 07:00:49,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:00:49,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:00:49,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:00:49,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:00:49,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:00:49,057 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-10 07:00:51,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 07:00:55,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 07:00:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:00:56,064 INFO L93 Difference]: Finished difference Result 588 states and 881 transitions. [2024-11-10 07:00:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:00:56,066 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-10 07:00:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:00:56,076 INFO L225 Difference]: With dead ends: 588 [2024-11-10 07:00:56,077 INFO L226 Difference]: Without dead ends: 403 [2024-11-10 07:00:56,079 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-10 07:00:56,081 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 160 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s 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, 6.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:00:56,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 520 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-10 07:00:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-10 07:00:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 294. [2024-11-10 07:00:56,146 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-10 07:00:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 423 transitions. [2024-11-10 07:00:56,150 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 423 transitions. Word has length 146 [2024-11-10 07:00:56,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:00:56,151 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 423 transitions. [2024-11-10 07:00:56,151 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-10 07:00:56,151 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 423 transitions. [2024-11-10 07:00:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:00:56,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:00:56,154 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-10 07:00:56,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 07:00:56,354 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-10 07:00:56,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:00:56,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:00:56,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1485513859, now seen corresponding path program 1 times [2024-11-10 07:00:56,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:00:56,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120934103] [2024-11-10 07:00:56,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:00:56,357 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-10 07:00:56,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:00:56,358 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-10 07:00:56,365 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-10 07:00:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:00:56,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 07:00:56,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:00:57,688 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-10 07:00:57,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:00:57,689 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:00:57,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120934103] [2024-11-10 07:00:57,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120934103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:00:57,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:00:57,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:00:57,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087064619] [2024-11-10 07:00:57,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:00:57,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:00:57,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:00:57,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:00:57,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:00:57,694 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-10 07:01:00,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:01:02,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:01:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:01:02,833 INFO L93 Difference]: Finished difference Result 960 states and 1377 transitions. [2024-11-10 07:01:02,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:01:02,881 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-10 07:01:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:01:02,890 INFO L225 Difference]: With dead ends: 960 [2024-11-10 07:01:02,892 INFO L226 Difference]: Without dead ends: 674 [2024-11-10 07:01:02,894 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-10 07:01:02,894 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 176 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:01:02,895 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.9s Time] [2024-11-10 07:01:02,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2024-11-10 07:01:02,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 503. [2024-11-10 07:01:02,980 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-10 07:01:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 728 transitions. [2024-11-10 07:01:02,986 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 728 transitions. Word has length 146 [2024-11-10 07:01:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:01:02,988 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 728 transitions. [2024-11-10 07:01:02,988 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-10 07:01:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 728 transitions. [2024-11-10 07:01:02,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-10 07:01:02,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:01:02,992 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-10 07:01:03,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 07:01:03,194 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-10 07:01:03,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:01:03,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:01:03,195 INFO L85 PathProgramCache]: Analyzing trace with hash 974979682, now seen corresponding path program 1 times [2024-11-10 07:01:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:01:03,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752599701] [2024-11-10 07:01:03,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:01:03,196 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-10 07:01:03,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:01:03,199 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-10 07:01:03,201 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-10 07:01:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:01:03,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 07:01:03,530 INFO L278 TraceCheckSpWp]: Computing forward predicates...