./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:55:56,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:55:56,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:55:56,872 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:55:56,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:55:56,916 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:55:56,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:55:56,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:55:56,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:55:56,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:55:56,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:55:56,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:55:56,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:55:56,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:55:56,927 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:55:56,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:55:56,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:55:56,928 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:55:56,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:55:56,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:55:56,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:55:56,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:55:56,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:55:56,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:55:56,933 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:55:56,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:55:56,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:55:56,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:55:56,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:55:56,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:55:56,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:55:56,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:55:56,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:55:56,936 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:55:56,936 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:55:56,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:55:56,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:55:56,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:55:56,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:55:56,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:55:56,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:55:56,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:55:56,939 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-12 04:55:57,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:55:57,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:55:57,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:55:57,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:55:57,285 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:55:57,287 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-12 04:55:59,002 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:55:59,246 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:55:59,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-12 04:55:59,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f3096c2/d0ca57ed2fbb4918be282fa41e0ac9ea/FLAGdbf1f5b70 [2024-11-12 04:55:59,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2f3096c2/d0ca57ed2fbb4918be282fa41e0ac9ea [2024-11-12 04:55:59,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:55:59,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:55:59,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:55:59,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:55:59,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:55:59,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,290 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48093155 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59, skipping insertion in model container [2024-11-12 04:55:59,290 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:55:59,534 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-12 04:55:59,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:55:59,672 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:55:59,688 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-12 04:55:59,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:55:59,778 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:55:59,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59 WrapperNode [2024-11-12 04:55:59,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:55:59,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:55:59,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:55:59,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:55:59,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,864 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-11-12 04:55:59,864 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:55:59,865 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:55:59,865 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:55:59,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:55:59,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,929 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-12 04:55:59,930 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,930 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,946 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,959 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:55:59,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:55:59,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:55:59,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:55:59,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (1/1) ... [2024-11-12 04:55:59,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:56:00,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:56:00,033 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-12 04:56:00,074 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-12 04:56:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:56:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:56:00,130 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:56:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:56:00,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:56:00,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:56:00,251 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:56:00,256 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:56:00,847 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-12 04:56:00,847 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:56:00,865 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:56:00,866 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:56:00,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:00 BoogieIcfgContainer [2024-11-12 04:56:00,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:56:00,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:56:00,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:56:00,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:56:00,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:55:59" (1/3) ... [2024-11-12 04:56:00,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33525a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:56:00, skipping insertion in model container [2024-11-12 04:56:00,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:55:59" (2/3) ... [2024-11-12 04:56:00,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33525a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:56:00, skipping insertion in model container [2024-11-12 04:56:00,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:00" (3/3) ... [2024-11-12 04:56:00,877 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-12 04:56:00,892 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:56:00,892 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:56:00,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:56:00,970 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;@87ad8e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:56:00,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:56:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 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-12 04:56:00,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 04:56:00,991 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:00,992 INFO L218 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-12 04:56:00,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:00,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:00,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1520053350, now seen corresponding path program 1 times [2024-11-12 04:56:01,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:01,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299086238] [2024-11-12 04:56:01,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:01,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:56:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:56:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:56:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 04:56:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 04:56:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 04:56:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:01,518 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-12 04:56:01,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:01,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299086238] [2024-11-12 04:56:01,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299086238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:01,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:01,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:56:01,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955997731] [2024-11-12 04:56:01,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:01,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:56:01,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:01,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:56:01,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:56:01,566 INFO L87 Difference]: Start difference. First operand has 99 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-12 04:56:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:01,609 INFO L93 Difference]: Finished difference Result 195 states and 322 transitions. [2024-11-12 04:56:01,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:56:01,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (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 145 [2024-11-12 04:56:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:01,622 INFO L225 Difference]: With dead ends: 195 [2024-11-12 04:56:01,622 INFO L226 Difference]: Without dead ends: 95 [2024-11-12 04:56:01,628 INFO L434 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-12 04:56:01,633 INFO L435 NwaCegarLoop]: 149 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, 149 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-12 04:56:01,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:56:01,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-12 04:56:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-12 04:56:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 72 states have internal predecessors, (103), 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-12 04:56:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 145 transitions. [2024-11-12 04:56:01,695 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 145 transitions. Word has length 145 [2024-11-12 04:56:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:01,696 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 145 transitions. [2024-11-12 04:56:01,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (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-12 04:56:01,696 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 145 transitions. [2024-11-12 04:56:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 04:56:01,700 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:01,701 INFO L218 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-12 04:56:01,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:56:01,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:01,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:01,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1723906588, now seen corresponding path program 1 times [2024-11-12 04:56:01,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:01,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982915238] [2024-11-12 04:56:01,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:56:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:56:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:56:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 04:56:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 04:56:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 04:56:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:02,428 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-12 04:56:02,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:02,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982915238] [2024-11-12 04:56:02,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982915238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:02,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:02,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:56:02,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549081505] [2024-11-12 04:56:02,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:02,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:56:02,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:02,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:56:02,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:56:02,439 INFO L87 Difference]: Start difference. First operand 95 states and 145 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-12 04:56:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:03,002 INFO L93 Difference]: Finished difference Result 373 states and 574 transitions. [2024-11-12 04:56:03,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:56:03,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 145 [2024-11-12 04:56:03,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:03,009 INFO L225 Difference]: With dead ends: 373 [2024-11-12 04:56:03,009 INFO L226 Difference]: Without dead ends: 281 [2024-11-12 04:56:03,011 INFO L434 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-12 04:56:03,012 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 402 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:03,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 634 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 04:56:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-12 04:56:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 187. [2024-11-12 04:56:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 142 states have (on average 1.4366197183098592) internal successors, (204), 142 states have internal predecessors, (204), 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-12 04:56:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 288 transitions. [2024-11-12 04:56:03,061 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 288 transitions. Word has length 145 [2024-11-12 04:56:03,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:03,062 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 288 transitions. [2024-11-12 04:56:03,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-12 04:56:03,062 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 288 transitions. [2024-11-12 04:56:03,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 04:56:03,068 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:03,069 INFO L218 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-12 04:56:03,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:56:03,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:03,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:03,071 INFO L85 PathProgramCache]: Analyzing trace with hash 135558686, now seen corresponding path program 1 times [2024-11-12 04:56:03,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:03,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881476611] [2024-11-12 04:56:03,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:03,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:56:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:56:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:56:03,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:03,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:03,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 04:56:03,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 04:56:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 04:56:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:03,433 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-12 04:56:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881476611] [2024-11-12 04:56:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881476611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:03,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:03,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:56:03,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056791377] [2024-11-12 04:56:03,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:03,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:56:03,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:03,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:56:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:56:03,437 INFO L87 Difference]: Start difference. First operand 187 states and 288 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-12 04:56:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:03,568 INFO L93 Difference]: Finished difference Result 384 states and 586 transitions. [2024-11-12 04:56:03,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:56:03,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 145 [2024-11-12 04:56:03,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:03,572 INFO L225 Difference]: With dead ends: 384 [2024-11-12 04:56:03,572 INFO L226 Difference]: Without dead ends: 200 [2024-11-12 04:56:03,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:56:03,575 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 79 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:03,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 190 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:56:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-12 04:56:03,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2024-11-12 04:56:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 150 states have (on average 1.4) internal successors, (210), 151 states have internal predecessors, (210), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-12 04:56:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2024-11-12 04:56:03,602 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 298 transitions. Word has length 145 [2024-11-12 04:56:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:03,602 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 298 transitions. [2024-11-12 04:56:03,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-12 04:56:03,603 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 298 transitions. [2024-11-12 04:56:03,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 04:56:03,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:03,605 INFO L218 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-12 04:56:03,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:56:03,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:03,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1415422364, now seen corresponding path program 1 times [2024-11-12 04:56:03,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:03,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364667967] [2024-11-12 04:56:03,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:03,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:03,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:56:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:56:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:56:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 04:56:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 04:56:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 04:56:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:04,482 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-12 04:56:04,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:04,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364667967] [2024-11-12 04:56:04,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364667967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:04,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:04,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 04:56:04,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066589827] [2024-11-12 04:56:04,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:04,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 04:56:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:04,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 04:56:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:56:04,485 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-12 04:56:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:04,863 INFO L93 Difference]: Finished difference Result 762 states and 1142 transitions. [2024-11-12 04:56:04,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 04:56:04,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 145 [2024-11-12 04:56:04,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:04,868 INFO L225 Difference]: With dead ends: 762 [2024-11-12 04:56:04,869 INFO L226 Difference]: Without dead ends: 570 [2024-11-12 04:56:04,870 INFO L434 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-12 04:56:04,871 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 404 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:04,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 862 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:56:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-12 04:56:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 381. [2024-11-12 04:56:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 277 states have (on average 1.3537906137184115) internal successors, (375), 278 states have internal predecessors, (375), 93 states have call successors, (93), 10 states have call predecessors, (93), 10 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-12 04:56:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 561 transitions. [2024-11-12 04:56:04,949 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 561 transitions. Word has length 145 [2024-11-12 04:56:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:04,951 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 561 transitions. [2024-11-12 04:56:04,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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-12 04:56:04,952 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 561 transitions. [2024-11-12 04:56:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 04:56:04,956 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:04,956 INFO L218 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-12 04:56:04,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:56:04,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:04,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:04,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1314826524, now seen corresponding path program 1 times [2024-11-12 04:56:04,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:04,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758764380] [2024-11-12 04:56:04,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:04,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:56:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:56:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:56:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:05,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 04:56:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 04:56:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 04:56:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:05,247 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-12 04:56:05,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758764380] [2024-11-12 04:56:05,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758764380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:05,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:05,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:56:05,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544698293] [2024-11-12 04:56:05,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:05,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:56:05,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:05,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:56:05,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:56:05,250 INFO L87 Difference]: Start difference. First operand 381 states and 561 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-12 04:56:05,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:05,680 INFO L93 Difference]: Finished difference Result 745 states and 1095 transitions. [2024-11-12 04:56:05,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:56:05,681 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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 145 [2024-11-12 04:56:05,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:05,686 INFO L225 Difference]: With dead ends: 745 [2024-11-12 04:56:05,687 INFO L226 Difference]: Without dead ends: 563 [2024-11-12 04:56:05,688 INFO L434 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-12 04:56:05,689 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 275 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:05,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 641 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:56:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-12 04:56:05,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 561. [2024-11-12 04:56:05,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 410 states have (on average 1.353658536585366) internal successors, (555), 411 states have internal predecessors, (555), 135 states have call successors, (135), 15 states have call predecessors, (135), 15 states have return successors, (135), 134 states have call predecessors, (135), 135 states have call successors, (135) [2024-11-12 04:56:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 825 transitions. [2024-11-12 04:56:05,746 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 825 transitions. Word has length 145 [2024-11-12 04:56:05,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:05,747 INFO L471 AbstractCegarLoop]: Abstraction has 561 states and 825 transitions. [2024-11-12 04:56:05,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-12 04:56:05,747 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 825 transitions. [2024-11-12 04:56:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 04:56:05,749 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:05,749 INFO L218 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-12 04:56:05,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:56:05,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:05,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:05,750 INFO L85 PathProgramCache]: Analyzing trace with hash -273521378, now seen corresponding path program 1 times [2024-11-12 04:56:05,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:05,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107468067] [2024-11-12 04:56:05,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:56:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:06,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:56:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:56:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 04:56:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 04:56:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 04:56:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:06,483 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-12 04:56:06,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:06,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107468067] [2024-11-12 04:56:06,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107468067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:06,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:06,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:56:06,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69611157] [2024-11-12 04:56:06,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:06,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:56:06,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:06,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:56:06,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:56:06,487 INFO L87 Difference]: Start difference. First operand 561 states and 825 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-12 04:56:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:07,175 INFO L93 Difference]: Finished difference Result 1299 states and 1883 transitions. [2024-11-12 04:56:07,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:56:07,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 145 [2024-11-12 04:56:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:07,181 INFO L225 Difference]: With dead ends: 1299 [2024-11-12 04:56:07,182 INFO L226 Difference]: Without dead ends: 755 [2024-11-12 04:56:07,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 04:56:07,185 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 292 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:07,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 239 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 04:56:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2024-11-12 04:56:07,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 585. [2024-11-12 04:56:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 434 states have (on average 1.3202764976958525) internal successors, (573), 435 states have internal predecessors, (573), 135 states have call successors, (135), 15 states have call predecessors, (135), 15 states have return successors, (135), 134 states have call predecessors, (135), 135 states have call successors, (135) [2024-11-12 04:56:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 843 transitions. [2024-11-12 04:56:07,275 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 843 transitions. Word has length 145 [2024-11-12 04:56:07,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:07,275 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 843 transitions. [2024-11-12 04:56:07,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-12 04:56:07,276 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 843 transitions. [2024-11-12 04:56:07,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-12 04:56:07,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:07,279 INFO L218 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-12 04:56:07,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:56:07,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:07,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1082868004, now seen corresponding path program 1 times [2024-11-12 04:56:07,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:07,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707678354] [2024-11-12 04:56:07,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:07,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:56:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:56:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 04:56:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:56:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 04:56:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:56:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:56:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:56:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:56:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:56:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:56:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:56:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 04:56:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 04:56:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 04:56:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 04:56:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 04:56:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 04:56:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 04:56:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 04:56:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 04:56:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,786 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-12 04:56:07,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:56:07,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707678354] [2024-11-12 04:56:07,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707678354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:56:07,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199321897] [2024-11-12 04:56:07,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:07,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:56:07,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:56:07,789 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-12 04:56:07,791 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-12 04:56:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:07,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 04:56:07,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:56:08,400 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-12 04:56:08,401 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:56:08,893 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-12 04:56:08,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199321897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:56:08,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 04:56:08,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2024-11-12 04:56:08,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339292868] [2024-11-12 04:56:08,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 04:56:08,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 04:56:08,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:56:08,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 04:56:08,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-12 04:56:08,897 INFO L87 Difference]: Start difference. First operand 585 states and 843 transitions. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2024-11-12 04:56:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:10,373 INFO L93 Difference]: Finished difference Result 1580 states and 2257 transitions. [2024-11-12 04:56:10,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-12 04:56:10,375 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) Word has length 145 [2024-11-12 04:56:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:10,383 INFO L225 Difference]: With dead ends: 1580 [2024-11-12 04:56:10,384 INFO L226 Difference]: Without dead ends: 1012 [2024-11-12 04:56:10,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=375, Invalid=1431, Unknown=0, NotChecked=0, Total=1806 [2024-11-12 04:56:10,389 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 1515 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:10,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1307 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 04:56:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-12 04:56:10,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 796. [2024-11-12 04:56:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 584 states have (on average 1.2842465753424657) internal successors, (750), 589 states have internal predecessors, (750), 186 states have call successors, (186), 25 states have call predecessors, (186), 25 states have return successors, (186), 181 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-12 04:56:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1122 transitions. [2024-11-12 04:56:10,501 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1122 transitions. Word has length 145 [2024-11-12 04:56:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:10,501 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1122 transitions. [2024-11-12 04:56:10,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 4 states have call successors, (63), 3 states have call predecessors, (63), 6 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63) [2024-11-12 04:56:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1122 transitions. [2024-11-12 04:56:10,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-12 04:56:10,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:10,503 INFO L218 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-12 04:56:10,523 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-12 04:56:10,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:56:10,705 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:10,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1122037976, now seen corresponding path program 1 times [2024-11-12 04:56:10,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:56:10,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634069379] [2024-11-12 04:56:10,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:10,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:56:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 04:56:10,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864829047] [2024-11-12 04:56:10,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:10,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:56:10,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:56:10,862 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-12 04:56:10,864 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-12 04:56:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:56:11,019 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 04:56:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 04:56:11,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 04:56:11,269 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 04:56:11,270 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:56:11,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 04:56:11,472 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,SelfDestructingSolverStorable7 [2024-11-12 04:56:11,476 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:56:11,606 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:56:11,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:56:11 BoogieIcfgContainer [2024-11-12 04:56:11,609 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:56:11,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:56:11,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:56:11,610 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:56:11,611 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:00" (3/4) ... [2024-11-12 04:56:11,613 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 04:56:11,614 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:56:11,614 INFO L158 Benchmark]: Toolchain (without parser) took 12337.04ms. Allocated memory was 151.0MB in the beginning and 293.6MB in the end (delta: 142.6MB). Free memory was 94.9MB in the beginning and 98.0MB in the end (delta: -3.2MB). Peak memory consumption was 141.0MB. Max. memory is 16.1GB. [2024-11-12 04:56:11,615 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 151.0MB. Free memory was 110.6MB in the beginning and 110.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:56:11,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.42ms. Allocated memory is still 151.0MB. Free memory was 94.9MB in the beginning and 76.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 04:56:11,615 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.15ms. Allocated memory is still 151.0MB. Free memory was 76.0MB in the beginning and 70.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:56:11,615 INFO L158 Benchmark]: Boogie Preprocessor took 114.34ms. Allocated memory is still 151.0MB. Free memory was 70.9MB in the beginning and 64.2MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:56:11,616 INFO L158 Benchmark]: RCFGBuilder took 886.00ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 64.2MB in the beginning and 142.0MB in the end (delta: -77.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-11-12 04:56:11,616 INFO L158 Benchmark]: TraceAbstraction took 10740.86ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 140.9MB in the beginning and 98.0MB in the end (delta: 42.9MB). Peak memory consumption was 134.1MB. Max. memory is 16.1GB. [2024-11-12 04:56:11,616 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 293.6MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:56:11,617 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.23ms. Allocated memory is still 151.0MB. Free memory was 110.6MB in the beginning and 110.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.42ms. Allocated memory is still 151.0MB. Free memory was 94.9MB in the beginning and 76.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.15ms. Allocated memory is still 151.0MB. Free memory was 76.0MB in the beginning and 70.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.34ms. Allocated memory is still 151.0MB. Free memory was 70.9MB in the beginning and 64.2MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 886.00ms. Allocated memory was 151.0MB in the beginning and 201.3MB in the end (delta: 50.3MB). Free memory was 64.2MB in the beginning and 142.0MB in the end (delta: -77.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 10740.86ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 140.9MB in the beginning and 98.0MB in the end (delta: 42.9MB). Peak memory consumption was 134.1MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 293.6MB. Free memory is still 98.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of 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=0] [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=0] [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=0] [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=0] [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=0] [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=0] [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=1, 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=0] [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=1, 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=0] [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=1, 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=0] [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=1, 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=0] [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=1, 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=0] [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=1, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=0] [L66] COND FALSE !((- var_1_24) < var_1_23) 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=1, var_1_12=-32, var_1_13=2, 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=0] [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=1, var_1_12=-32, var_1_13=2, 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=1, var_1_38=1, var_1_39=1, var_1_7=-25, var_1_9=0] [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=1, var_1_12=-32, var_1_13=2, 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=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=0, var_1_10=-128, var_1_11=1, var_1_12=-32, var_1_13=2, 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=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=-32, var_1_13=2, 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=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, 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=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, 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=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, 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=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, 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=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, 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=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, 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=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, 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=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, 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=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, 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=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=1, 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=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=1, 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=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=1, 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=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] [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=1, var_1_12=0, var_1_13=2, var_1_14=1, var_1_15=1, 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=44831, var_1_35=49150, var_1_37=1, var_1_38=1, var_1_39=1, var_1_7=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2969 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2967 mSDsluCounter, 4022 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3023 mSDsCounter, 679 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1615 IncrementalHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 679 mSolverCounterUnsat, 999 mSDtfsCounter, 1615 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 688 GetRequests, 616 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=796occurred in iteration=7, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 672 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1452 NumberOfCodeBlocks, 1452 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1296 ConstructedInterpolants, 0 QuantifiedInterpolants, 3665 SizeOfPredicates, 4 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 7470/7560 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-12 04:56:11,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:56:14,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:56:14,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 04:56:14,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:56:14,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:56:14,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:56:14,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:56:14,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:56:14,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:56:14,296 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:56:14,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:56:14,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:56:14,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:56:14,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:56:14,300 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:56:14,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:56:14,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:56:14,301 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:56:14,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:56:14,301 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:56:14,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:56:14,306 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:56:14,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:56:14,306 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 04:56:14,307 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 04:56:14,307 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:56:14,307 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 04:56:14,307 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:56:14,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:56:14,308 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:56:14,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:56:14,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:56:14,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:56:14,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:56:14,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:56:14,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:56:14,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:56:14,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:56:14,312 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 04:56:14,312 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 04:56:14,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:56:14,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:56:14,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:56:14,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:56:14,314 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-12 04:56:14,671 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:56:14,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:56:14,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:56:14,701 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:56:14,702 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:56:14,703 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-12 04:56:16,380 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:56:16,625 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:56:16,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-12 04:56:16,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79082529c/a6a818d0d3b04ce9abf4795c74fcc725/FLAGa0472531c [2024-11-12 04:56:16,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79082529c/a6a818d0d3b04ce9abf4795c74fcc725 [2024-11-12 04:56:16,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:56:16,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:56:16,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:56:16,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:56:16,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:56:16,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:56:16" (1/1) ... [2024-11-12 04:56:16,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223b1dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:16, skipping insertion in model container [2024-11-12 04:56:16,673 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:56:16" (1/1) ... [2024-11-12 04:56:16,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:56:16,899 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-12 04:56:16,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:56:17,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:56:17,022 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-12 04:56:17,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:56:17,096 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:56:17,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17 WrapperNode [2024-11-12 04:56:17,097 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:56:17,098 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:56:17,098 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:56:17,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:56:17,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,166 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-12 04:56:17,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:56:17,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:56:17,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:56:17,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:56:17,187 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,197 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,224 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-12 04:56:17,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:56:17,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:56:17,262 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:56:17,262 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:56:17,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (1/1) ... [2024-11-12 04:56:17,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:56:17,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:56:17,306 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-12 04:56:17,310 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-12 04:56:17,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:56:17,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 04:56:17,356 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:56:17,356 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:56:17,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:56:17,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:56:17,447 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:56:17,450 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:56:26,334 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-12 04:56:26,335 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:56:26,350 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:56:26,351 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:56:26,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:26 BoogieIcfgContainer [2024-11-12 04:56:26,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:56:26,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:56:26,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:56:26,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:56:26,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:56:16" (1/3) ... [2024-11-12 04:56:26,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45cb6b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:56:26, skipping insertion in model container [2024-11-12 04:56:26,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:17" (2/3) ... [2024-11-12 04:56:26,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45cb6b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:56:26, skipping insertion in model container [2024-11-12 04:56:26,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:26" (3/3) ... [2024-11-12 04:56:26,363 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-16.i [2024-11-12 04:56:26,381 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:56:26,381 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:56:26,463 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:56:26,471 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;@69e81417, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:56:26,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:56:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 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-12 04:56:26,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 04:56:26,493 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:26,494 INFO L218 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] [2024-11-12 04:56:26,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:26,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1703044128, now seen corresponding path program 1 times [2024-11-12 04:56:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:56:26,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303910432] [2024-11-12 04:56:26,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:26,519 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-12 04:56:26,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:56:26,522 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-12 04:56:26,527 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-12 04:56:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:26,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 04:56:26,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:56:27,050 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-12 04:56:27,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:56:27,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:56:27,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303910432] [2024-11-12 04:56:27,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303910432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:27,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:27,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:56:27,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577803447] [2024-11-12 04:56:27,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:27,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:56:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:56:27,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:56:27,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:56:27,090 INFO L87 Difference]: Start difference. First operand has 77 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 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), 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-12 04:56:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:27,124 INFO L93 Difference]: Finished difference Result 151 states and 254 transitions. [2024-11-12 04:56:27,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:56:27,127 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), 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 143 [2024-11-12 04:56:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:27,135 INFO L225 Difference]: With dead ends: 151 [2024-11-12 04:56:27,136 INFO L226 Difference]: Without dead ends: 73 [2024-11-12 04:56:27,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-12 04:56:27,145 INFO L435 NwaCegarLoop]: 115 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, 115 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-12 04:56:27,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:56:27,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-12 04:56:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-12 04:56:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 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-12 04:56:27,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2024-11-12 04:56:27,203 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 143 [2024-11-12 04:56:27,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:27,205 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2024-11-12 04:56:27,206 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), 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-12 04:56:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2024-11-12 04:56:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-12 04:56:27,211 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:27,212 INFO L218 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] [2024-11-12 04:56:27,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 04:56:27,416 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-12 04:56:27,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:27,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:27,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1237522602, now seen corresponding path program 1 times [2024-11-12 04:56:27,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:56:27,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581217694] [2024-11-12 04:56:27,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:27,420 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-12 04:56:27,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:56:27,421 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-12 04:56:27,424 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-12 04:56:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:27,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 04:56:27,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:56:29,825 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-12 04:56:29,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:56:30,973 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-12 04:56:30,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:56:30,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581217694] [2024-11-12 04:56:30,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581217694] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 04:56:30,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 04:56:30,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2024-11-12 04:56:30,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261641028] [2024-11-12 04:56:30,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 04:56:30,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 04:56:30,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:56:30,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 04:56:30,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:56:30,979 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-12 04:56:36,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:56:40,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:56:40,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:40,615 INFO L93 Difference]: Finished difference Result 297 states and 450 transitions. [2024-11-12 04:56:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 04:56:40,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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 143 [2024-11-12 04:56:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:40,621 INFO L225 Difference]: With dead ends: 297 [2024-11-12 04:56:40,621 INFO L226 Difference]: Without dead ends: 227 [2024-11-12 04:56:40,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2024-11-12 04:56:40,624 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 268 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:40,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 620 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2024-11-12 04:56:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-12 04:56:40,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 187. [2024-11-12 04:56:40,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 132 states have (on average 1.393939393939394) internal successors, (184), 133 states have internal predecessors, (184), 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-12 04:56:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 286 transitions. [2024-11-12 04:56:40,667 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 286 transitions. Word has length 143 [2024-11-12 04:56:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:40,669 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 286 transitions. [2024-11-12 04:56:40,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 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-12 04:56:40,669 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 286 transitions. [2024-11-12 04:56:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 04:56:40,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:40,671 INFO L218 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] [2024-11-12 04:56:40,684 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-12 04:56:40,873 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-12 04:56:40,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:40,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:40,874 INFO L85 PathProgramCache]: Analyzing trace with hash -329128056, now seen corresponding path program 1 times [2024-11-12 04:56:40,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:56:40,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779738660] [2024-11-12 04:56:40,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:40,875 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-12 04:56:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:56:40,879 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-12 04:56:40,880 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-12 04:56:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:41,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 04:56:41,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:56:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-11-12 04:56:42,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 04:56:42,683 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-12 04:56:42,683 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:56:42,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779738660] [2024-11-12 04:56:42,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779738660] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 04:56:42,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 04:56:42,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-12 04:56:42,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073309881] [2024-11-12 04:56:42,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:42,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:56:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:56:42,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:56:42,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:56:42,690 INFO L87 Difference]: Start difference. First operand 187 states and 286 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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-12 04:56:46,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:56:46,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:46,646 INFO L93 Difference]: Finished difference Result 383 states and 578 transitions. [2024-11-12 04:56:46,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:56:46,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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 144 [2024-11-12 04:56:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:46,656 INFO L225 Difference]: With dead ends: 383 [2024-11-12 04:56:46,660 INFO L226 Difference]: Without dead ends: 199 [2024-11-12 04:56:46,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:56:46,667 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:46,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 152 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-12 04:56:46,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-12 04:56:46,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2024-11-12 04:56:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 141 states have (on average 1.3404255319148937) internal successors, (189), 142 states have internal predecessors, (189), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-12 04:56:46,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2024-11-12 04:56:46,710 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 144 [2024-11-12 04:56:46,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:46,713 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2024-11-12 04:56:46,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (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-12 04:56:46,714 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2024-11-12 04:56:46,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 04:56:46,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:46,721 INFO L218 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] [2024-11-12 04:56:46,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-12 04:56:46,921 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-12 04:56:46,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:46,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:46,922 INFO L85 PathProgramCache]: Analyzing trace with hash 257677958, now seen corresponding path program 1 times [2024-11-12 04:56:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:56:46,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837961474] [2024-11-12 04:56:46,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:46,924 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-12 04:56:46,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:56:46,927 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-12 04:56:46,928 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-12 04:56:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:47,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 04:56:47,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:56:47,506 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-12 04:56:47,506 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:56:47,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:56:47,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837961474] [2024-11-12 04:56:47,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837961474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:47,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:47,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:56:47,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646209465] [2024-11-12 04:56:47,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:47,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:56:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:56:47,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:56:47,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:56:47,509 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-12 04:56:52,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 04:56:53,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 04:56:56,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-12 04:56:57,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:56:57,001 INFO L93 Difference]: Finished difference Result 600 states and 877 transitions. [2024-11-12 04:56:57,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:56:57,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 144 [2024-11-12 04:56:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:56:57,007 INFO L225 Difference]: With dead ends: 600 [2024-11-12 04:56:57,007 INFO L226 Difference]: Without dead ends: 404 [2024-11-12 04:56:57,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 04:56:57,010 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 155 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:56:57,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 513 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 137 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2024-11-12 04:56:57,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-12 04:56:57,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 214. [2024-11-12 04:56:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 157 states have internal predecessors, (207), 51 states have call successors, (51), 6 states have call predecessors, (51), 6 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-12 04:56:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 309 transitions. [2024-11-12 04:56:57,052 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 309 transitions. Word has length 144 [2024-11-12 04:56:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:56:57,053 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 309 transitions. [2024-11-12 04:56:57,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-12 04:56:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 309 transitions. [2024-11-12 04:56:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 04:56:57,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:56:57,059 INFO L218 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] [2024-11-12 04:56:57,076 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-12 04:56:57,259 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-12 04:56:57,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:56:57,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:56:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 314936260, now seen corresponding path program 1 times [2024-11-12 04:56:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:56:57,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977384160] [2024-11-12 04:56:57,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:56:57,261 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-12 04:56:57,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:56:57,265 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-12 04:56:57,267 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-12 04:56:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:56:57,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 04:56:57,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:56:58,849 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-12 04:56:58,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:56:58,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 04:56:58,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977384160] [2024-11-12 04:56:58,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977384160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:56:58,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:56:58,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:56:58,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161562303] [2024-11-12 04:56:58,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:56:58,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:56:58,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 04:56:58,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:56:58,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:56:58,852 INFO L87 Difference]: Start difference. First operand 214 states and 309 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (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-12 04:57:04,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:57:09,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 04:57:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:57:09,322 INFO L93 Difference]: Finished difference Result 716 states and 1031 transitions. [2024-11-12 04:57:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:57:09,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (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 144 [2024-11-12 04:57:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:57:09,365 INFO L225 Difference]: With dead ends: 716 [2024-11-12 04:57:09,366 INFO L226 Difference]: Without dead ends: 505 [2024-11-12 04:57:09,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 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-12 04:57:09,368 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 204 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 46 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:57:09,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 424 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 10.3s Time] [2024-11-12 04:57:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-12 04:57:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 423. [2024-11-12 04:57:09,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 308 states have (on average 1.3181818181818181) internal successors, (406), 310 states have internal predecessors, (406), 102 states have call successors, (102), 12 states have call predecessors, (102), 12 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-12 04:57:09,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 610 transitions. [2024-11-12 04:57:09,459 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 610 transitions. Word has length 144 [2024-11-12 04:57:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:57:09,460 INFO L471 AbstractCegarLoop]: Abstraction has 423 states and 610 transitions. [2024-11-12 04:57:09,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (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-12 04:57:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 610 transitions. [2024-11-12 04:57:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-12 04:57:09,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:57:09,463 INFO L218 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] [2024-11-12 04:57:09,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-12 04:57:09,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 04:57:09,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:57:09,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:57:09,665 INFO L85 PathProgramCache]: Analyzing trace with hash -964927418, now seen corresponding path program 1 times [2024-11-12 04:57:09,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 04:57:09,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451638134] [2024-11-12 04:57:09,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:57:09,666 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-12 04:57:09,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 04:57:09,669 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 04:57:09,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 04:57:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:57:09,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 04:57:09,989 INFO L279 TraceCheckSpWp]: Computing forward predicates...