./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.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 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:43:23,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:43:23,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:43:23,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:43:23,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:43:23,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:43:23,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:43:23,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:43:23,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:43:23,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:43:23,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:43:23,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:43:23,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:43:23,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:43:23,940 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:43:23,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:43:23,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:43:23,941 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:43:23,942 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:43:23,942 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:43:23,942 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:43:23,943 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:43:23,943 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:43:23,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:43:23,944 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:43:23,945 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:43:23,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:43:23,946 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:43:23,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:43:23,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:43:23,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:43:23,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:43:23,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:43:23,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:43:23,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:43:23,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:43:23,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:43:23,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:43:23,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:43:23,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:43:23,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:43:23,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:43:23,951 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 -> 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 [2024-11-16 14:43:24,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:43:24,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:43:24,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:43:24,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:43:24,253 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:43:24,255 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-11-16 14:43:25,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:43:25,997 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:43:25,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-11-16 14:43:26,010 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/015345804/b1b7d42289fe40d2984afc3c7376f3e1/FLAG0f2fdca84 [2024-11-16 14:43:26,026 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/015345804/b1b7d42289fe40d2984afc3c7376f3e1 [2024-11-16 14:43:26,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:43:26,030 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:43:26,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:43:26,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:43:26,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:43:26,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210a3fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26, skipping insertion in model container [2024-11-16 14:43:26,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:43:26,267 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_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2024-11-16 14:43:26,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:43:26,414 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:43:26,427 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_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2024-11-16 14:43:26,498 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:43:26,526 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:43:26,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26 WrapperNode [2024-11-16 14:43:26,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:43:26,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:43:26,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:43:26,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:43:26,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,554 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,607 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 258 [2024-11-16 14:43:26,610 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:43:26,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:43:26,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:43:26,611 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:43:26,622 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,666 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 14:43:26,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:43:26,706 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:43:26,706 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:43:26,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:43:26,709 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (1/1) ... [2024-11-16 14:43:26,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:43:26,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:43:26,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 14:43:26,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 14:43:26,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:43:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:43:26,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:43:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:43:26,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:43:26,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:43:26,876 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:43:26,878 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:43:27,432 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-16 14:43:27,433 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:43:27,459 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:43:27,460 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 14:43:27,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:43:27 BoogieIcfgContainer [2024-11-16 14:43:27,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:43:27,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:43:27,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:43:27,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:43:27,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:43:26" (1/3) ... [2024-11-16 14:43:27,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45135e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:43:27, skipping insertion in model container [2024-11-16 14:43:27,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:26" (2/3) ... [2024-11-16 14:43:27,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45135e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:43:27, skipping insertion in model container [2024-11-16 14:43:27,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:43:27" (3/3) ... [2024-11-16 14:43:27,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-11-16 14:43:27,486 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:43:27,487 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:43:27,551 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:43:27,561 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;@3abd9fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:43:27,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:43:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 80 states have (on average 1.5) internal successors, (120), 81 states have internal predecessors, (120), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 14:43:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 14:43:27,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:27,586 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:27,587 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:27,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:27,593 INFO L85 PathProgramCache]: Analyzing trace with hash 970341193, now seen corresponding path program 1 times [2024-11-16 14:43:27,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:27,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064499612] [2024-11-16 14:43:27,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:27,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:27,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:27,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:28,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:28,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064499612] [2024-11-16 14:43:28,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064499612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:28,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:28,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:43:28,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910343572] [2024-11-16 14:43:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:28,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:43:28,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:28,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:43:28,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:43:28,323 INFO L87 Difference]: Start difference. First operand has 112 states, 80 states have (on average 1.5) internal successors, (120), 81 states have internal predecessors, (120), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 14:43:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:28,448 INFO L93 Difference]: Finished difference Result 216 states and 378 transitions. [2024-11-16 14:43:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:43:28,453 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 192 [2024-11-16 14:43:28,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:28,466 INFO L225 Difference]: With dead ends: 216 [2024-11-16 14:43:28,466 INFO L226 Difference]: Without dead ends: 107 [2024-11-16 14:43:28,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:43:28,478 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:28,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:43:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-16 14:43:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-16 14:43:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 76 states have internal predecessors, (112), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 14:43:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 170 transitions. [2024-11-16 14:43:28,548 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 170 transitions. Word has length 192 [2024-11-16 14:43:28,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:28,548 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 170 transitions. [2024-11-16 14:43:28,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 14:43:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 170 transitions. [2024-11-16 14:43:28,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 14:43:28,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:28,556 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:28,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:43:28,557 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:28,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2113825294, now seen corresponding path program 1 times [2024-11-16 14:43:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:28,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797013719] [2024-11-16 14:43:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:28,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:28,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:29,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:29,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:29,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:29,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:29,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797013719] [2024-11-16 14:43:29,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797013719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:29,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:29,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:43:29,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309440050] [2024-11-16 14:43:29,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:29,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:43:29,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:29,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:43:29,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:29,173 INFO L87 Difference]: Start difference. First operand 107 states and 170 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:29,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:29,327 INFO L93 Difference]: Finished difference Result 315 states and 504 transitions. [2024-11-16 14:43:29,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:43:29,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-16 14:43:29,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:29,335 INFO L225 Difference]: With dead ends: 315 [2024-11-16 14:43:29,337 INFO L226 Difference]: Without dead ends: 211 [2024-11-16 14:43:29,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:29,340 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 99 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:29,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 295 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:43:29,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-16 14:43:29,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 207. [2024-11-16 14:43:29,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 146 states have (on average 1.4726027397260273) internal successors, (215), 146 states have internal predecessors, (215), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-16 14:43:29,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 331 transitions. [2024-11-16 14:43:29,406 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 331 transitions. Word has length 192 [2024-11-16 14:43:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:29,408 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 331 transitions. [2024-11-16 14:43:29,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 331 transitions. [2024-11-16 14:43:29,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-16 14:43:29,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:29,418 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:29,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:43:29,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:29,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1552859199, now seen corresponding path program 1 times [2024-11-16 14:43:29,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:29,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819476246] [2024-11-16 14:43:29,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:29,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:29,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:29,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819476246] [2024-11-16 14:43:29,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819476246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:29,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:29,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:43:29,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538343988] [2024-11-16 14:43:29,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:29,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:43:29,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:29,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:43:29,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:43:29,968 INFO L87 Difference]: Start difference. First operand 207 states and 331 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:30,111 INFO L93 Difference]: Finished difference Result 601 states and 967 transitions. [2024-11-16 14:43:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:43:30,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-16 14:43:30,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:30,120 INFO L225 Difference]: With dead ends: 601 [2024-11-16 14:43:30,122 INFO L226 Difference]: Without dead ends: 397 [2024-11-16 14:43:30,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:43:30,127 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 99 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:30,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 452 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:43:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-16 14:43:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 394. [2024-11-16 14:43:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 273 states have (on average 1.4468864468864469) internal successors, (395), 273 states have internal predecessors, (395), 116 states have call successors, (116), 4 states have call predecessors, (116), 4 states have return successors, (116), 116 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-16 14:43:30,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 627 transitions. [2024-11-16 14:43:30,246 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 627 transitions. Word has length 192 [2024-11-16 14:43:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:30,248 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 627 transitions. [2024-11-16 14:43:30,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 627 transitions. [2024-11-16 14:43:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-16 14:43:30,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:30,253 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:30,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:43:30,253 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:30,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1190814278, now seen corresponding path program 1 times [2024-11-16 14:43:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101264921] [2024-11-16 14:43:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:30,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:30,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:30,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101264921] [2024-11-16 14:43:30,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101264921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:30,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:30,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 14:43:30,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905175850] [2024-11-16 14:43:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:30,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:43:30,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:30,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:43:30,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:43:30,710 INFO L87 Difference]: Start difference. First operand 394 states and 627 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:31,061 INFO L93 Difference]: Finished difference Result 881 states and 1399 transitions. [2024-11-16 14:43:31,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:43:31,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-16 14:43:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:31,068 INFO L225 Difference]: With dead ends: 881 [2024-11-16 14:43:31,068 INFO L226 Difference]: Without dead ends: 490 [2024-11-16 14:43:31,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:43:31,072 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 90 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:31,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 432 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 14:43:31,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-16 14:43:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 486. [2024-11-16 14:43:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 335 states have (on average 1.4328358208955223) internal successors, (480), 335 states have internal predecessors, (480), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-16 14:43:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 770 transitions. [2024-11-16 14:43:31,136 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 770 transitions. Word has length 194 [2024-11-16 14:43:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:31,137 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 770 transitions. [2024-11-16 14:43:31,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 770 transitions. [2024-11-16 14:43:31,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-16 14:43:31,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:31,141 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:31,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 14:43:31,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:31,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:31,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1043442579, now seen corresponding path program 1 times [2024-11-16 14:43:31,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:31,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704256580] [2024-11-16 14:43:31,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:31,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:31,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:31,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:31,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:31,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704256580] [2024-11-16 14:43:31,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704256580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:31,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:31,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:43:31,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813242369] [2024-11-16 14:43:31,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:31,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:43:31,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:31,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:43:31,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:31,367 INFO L87 Difference]: Start difference. First operand 486 states and 770 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:31,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:31,470 INFO L93 Difference]: Finished difference Result 1290 states and 2042 transitions. [2024-11-16 14:43:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:43:31,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 197 [2024-11-16 14:43:31,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:31,478 INFO L225 Difference]: With dead ends: 1290 [2024-11-16 14:43:31,478 INFO L226 Difference]: Without dead ends: 807 [2024-11-16 14:43:31,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:31,481 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 96 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:31,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 362 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:43:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-16 14:43:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 799. [2024-11-16 14:43:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 548 states have (on average 1.4288321167883211) internal successors, (783), 553 states have internal predecessors, (783), 240 states have call successors, (240), 10 states have call predecessors, (240), 10 states have return successors, (240), 235 states have call predecessors, (240), 240 states have call successors, (240) [2024-11-16 14:43:31,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1263 transitions. [2024-11-16 14:43:31,585 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1263 transitions. Word has length 197 [2024-11-16 14:43:31,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:31,586 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1263 transitions. [2024-11-16 14:43:31,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1263 transitions. [2024-11-16 14:43:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-16 14:43:31,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:31,590 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:31,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 14:43:31,590 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:31,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash 539809336, now seen corresponding path program 1 times [2024-11-16 14:43:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:31,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803133157] [2024-11-16 14:43:31,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:31,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:31,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:31,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:32,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:32,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803133157] [2024-11-16 14:43:32,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803133157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:32,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:32,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:43:32,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675613957] [2024-11-16 14:43:32,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:32,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:43:32,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:32,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:43:32,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:32,025 INFO L87 Difference]: Start difference. First operand 799 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:32,139 INFO L93 Difference]: Finished difference Result 1595 states and 2523 transitions. [2024-11-16 14:43:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:43:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 198 [2024-11-16 14:43:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:32,149 INFO L225 Difference]: With dead ends: 1595 [2024-11-16 14:43:32,149 INFO L226 Difference]: Without dead ends: 799 [2024-11-16 14:43:32,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:32,153 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:32,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 161 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:43:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-16 14:43:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2024-11-16 14:43:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 548 states have (on average 1.4105839416058394) internal successors, (773), 553 states have internal predecessors, (773), 240 states have call successors, (240), 10 states have call predecessors, (240), 10 states have return successors, (240), 235 states have call predecessors, (240), 240 states have call successors, (240) [2024-11-16 14:43:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1253 transitions. [2024-11-16 14:43:32,247 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1253 transitions. Word has length 198 [2024-11-16 14:43:32,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:32,250 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1253 transitions. [2024-11-16 14:43:32,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:32,251 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1253 transitions. [2024-11-16 14:43:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-16 14:43:32,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:32,253 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:32,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 14:43:32,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:32,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:32,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2047361145, now seen corresponding path program 1 times [2024-11-16 14:43:32,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:32,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353986986] [2024-11-16 14:43:32,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:32,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:32,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:32,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:32,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:32,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353986986] [2024-11-16 14:43:32,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353986986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:32,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:32,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:43:32,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61093648] [2024-11-16 14:43:32,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:32,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:43:32,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:43:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:32,786 INFO L87 Difference]: Start difference. First operand 799 states and 1253 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:32,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:32,929 INFO L93 Difference]: Finished difference Result 1740 states and 2736 transitions. [2024-11-16 14:43:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:43:32,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 198 [2024-11-16 14:43:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:32,937 INFO L225 Difference]: With dead ends: 1740 [2024-11-16 14:43:32,937 INFO L226 Difference]: Without dead ends: 944 [2024-11-16 14:43:32,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:32,941 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 74 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:32,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 295 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:43:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-16 14:43:33,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 900. [2024-11-16 14:43:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 619 states have (on average 1.4119547657512117) internal successors, (874), 624 states have internal predecessors, (874), 269 states have call successors, (269), 11 states have call predecessors, (269), 11 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2024-11-16 14:43:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1412 transitions. [2024-11-16 14:43:33,036 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1412 transitions. Word has length 198 [2024-11-16 14:43:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:33,036 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1412 transitions. [2024-11-16 14:43:33,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1412 transitions. [2024-11-16 14:43:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 14:43:33,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:33,039 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:33,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 14:43:33,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:33,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1599280814, now seen corresponding path program 1 times [2024-11-16 14:43:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:33,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888873390] [2024-11-16 14:43:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:33,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:33,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:33,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:33,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:33,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888873390] [2024-11-16 14:43:33,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888873390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:33,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:33,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 14:43:33,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766362279] [2024-11-16 14:43:33,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:33,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 14:43:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:33,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 14:43:33,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 14:43:33,437 INFO L87 Difference]: Start difference. First operand 900 states and 1412 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:33,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:33,703 INFO L93 Difference]: Finished difference Result 1715 states and 2695 transitions. [2024-11-16 14:43:33,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 14:43:33,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 199 [2024-11-16 14:43:33,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:33,711 INFO L225 Difference]: With dead ends: 1715 [2024-11-16 14:43:33,711 INFO L226 Difference]: Without dead ends: 903 [2024-11-16 14:43:33,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:43:33,715 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 94 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:33,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 687 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:43:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2024-11-16 14:43:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 900. [2024-11-16 14:43:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 619 states have (on average 1.3990306946688207) internal successors, (866), 624 states have internal predecessors, (866), 269 states have call successors, (269), 11 states have call predecessors, (269), 11 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2024-11-16 14:43:33,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1404 transitions. [2024-11-16 14:43:33,822 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1404 transitions. Word has length 199 [2024-11-16 14:43:33,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:33,823 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1404 transitions. [2024-11-16 14:43:33,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:33,823 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1404 transitions. [2024-11-16 14:43:33,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 14:43:33,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:33,827 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:33,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 14:43:33,827 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:33,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:33,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1190456589, now seen corresponding path program 1 times [2024-11-16 14:43:33,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:33,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784555157] [2024-11-16 14:43:33,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:33,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:34,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:34,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:34,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784555157] [2024-11-16 14:43:34,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784555157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:34,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:34,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:43:34,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721253039] [2024-11-16 14:43:34,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:34,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:43:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:34,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:43:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:34,336 INFO L87 Difference]: Start difference. First operand 900 states and 1404 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:34,479 INFO L93 Difference]: Finished difference Result 1741 states and 2719 transitions. [2024-11-16 14:43:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:43:34,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 199 [2024-11-16 14:43:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:34,487 INFO L225 Difference]: With dead ends: 1741 [2024-11-16 14:43:34,487 INFO L226 Difference]: Without dead ends: 944 [2024-11-16 14:43:34,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:34,490 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 72 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:34,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 312 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:43:34,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2024-11-16 14:43:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 904. [2024-11-16 14:43:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 623 states have (on average 1.3964686998394864) internal successors, (870), 628 states have internal predecessors, (870), 269 states have call successors, (269), 11 states have call predecessors, (269), 11 states have return successors, (269), 264 states have call predecessors, (269), 269 states have call successors, (269) [2024-11-16 14:43:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1408 transitions. [2024-11-16 14:43:34,573 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1408 transitions. Word has length 199 [2024-11-16 14:43:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:34,574 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1408 transitions. [2024-11-16 14:43:34,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1408 transitions. [2024-11-16 14:43:34,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 14:43:34,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:34,577 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:34,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 14:43:34,577 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:34,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:34,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1397300574, now seen corresponding path program 1 times [2024-11-16 14:43:34,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:34,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223020386] [2024-11-16 14:43:34,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:34,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:34,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:34,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223020386] [2024-11-16 14:43:34,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223020386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:34,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:34,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:43:34,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121415392] [2024-11-16 14:43:34,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:34,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:43:34,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:34,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:43:34,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:43:34,868 INFO L87 Difference]: Start difference. First operand 904 states and 1408 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:35,204 INFO L93 Difference]: Finished difference Result 3218 states and 4999 transitions. [2024-11-16 14:43:35,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:43:35,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 200 [2024-11-16 14:43:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:35,220 INFO L225 Difference]: With dead ends: 3218 [2024-11-16 14:43:35,221 INFO L226 Difference]: Without dead ends: 2421 [2024-11-16 14:43:35,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:43:35,226 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 263 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:35,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 542 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:43:35,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2024-11-16 14:43:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2405. [2024-11-16 14:43:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2405 states, 1724 states have (on average 1.4054524361948957) internal successors, (2423), 1744 states have internal predecessors, (2423), 649 states have call successors, (649), 31 states have call predecessors, (649), 31 states have return successors, (649), 629 states have call predecessors, (649), 649 states have call successors, (649) [2024-11-16 14:43:35,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3721 transitions. [2024-11-16 14:43:35,551 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3721 transitions. Word has length 200 [2024-11-16 14:43:35,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:35,553 INFO L471 AbstractCegarLoop]: Abstraction has 2405 states and 3721 transitions. [2024-11-16 14:43:35,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3721 transitions. [2024-11-16 14:43:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-16 14:43:35,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:35,557 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:35,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 14:43:35,557 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:35,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:35,558 INFO L85 PathProgramCache]: Analyzing trace with hash 400228221, now seen corresponding path program 1 times [2024-11-16 14:43:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:35,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323619738] [2024-11-16 14:43:35,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:35,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:35,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:35,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:35,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:35,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-16 14:43:35,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:35,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323619738] [2024-11-16 14:43:35,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323619738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:43:35,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191920947] [2024-11-16 14:43:35,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:35,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:43:35,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:43:35,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:43:35,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 14:43:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:36,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 14:43:36,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:43:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 840 proven. 42 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2024-11-16 14:43:36,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:43:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-16 14:43:36,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191920947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:43:36,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:43:36,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 14:43:36,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084631875] [2024-11-16 14:43:36,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:43:36,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 14:43:36,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:36,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 14:43:36,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:43:36,630 INFO L87 Difference]: Start difference. First operand 2405 states and 3721 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-16 14:43:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:37,173 INFO L93 Difference]: Finished difference Result 4811 states and 7341 transitions. [2024-11-16 14:43:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 14:43:37,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 200 [2024-11-16 14:43:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:37,192 INFO L225 Difference]: With dead ends: 4811 [2024-11-16 14:43:37,192 INFO L226 Difference]: Without dead ends: 2516 [2024-11-16 14:43:37,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 454 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 14:43:37,202 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 200 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:37,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 387 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 14:43:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2024-11-16 14:43:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2452. [2024-11-16 14:43:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 1750 states have (on average 1.3765714285714286) internal successors, (2409), 1770 states have internal predecessors, (2409), 649 states have call successors, (649), 52 states have call predecessors, (649), 52 states have return successors, (649), 629 states have call predecessors, (649), 649 states have call successors, (649) [2024-11-16 14:43:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3707 transitions. [2024-11-16 14:43:37,499 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3707 transitions. Word has length 200 [2024-11-16 14:43:37,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:37,500 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3707 transitions. [2024-11-16 14:43:37,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-16 14:43:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3707 transitions. [2024-11-16 14:43:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-16 14:43:37,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:37,504 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:37,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 14:43:37,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 14:43:37,705 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:37,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:37,706 INFO L85 PathProgramCache]: Analyzing trace with hash -423643645, now seen corresponding path program 1 times [2024-11-16 14:43:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:37,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723667826] [2024-11-16 14:43:37,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:38,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:38,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723667826] [2024-11-16 14:43:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723667826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:38,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:38,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 14:43:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110308681] [2024-11-16 14:43:38,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:38,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 14:43:38,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:38,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 14:43:38,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 14:43:38,214 INFO L87 Difference]: Start difference. First operand 2452 states and 3707 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:38,723 INFO L93 Difference]: Finished difference Result 5023 states and 7671 transitions. [2024-11-16 14:43:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 14:43:38,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 201 [2024-11-16 14:43:38,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:38,746 INFO L225 Difference]: With dead ends: 5023 [2024-11-16 14:43:38,747 INFO L226 Difference]: Without dead ends: 3174 [2024-11-16 14:43:38,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:43:38,756 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 317 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:38,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 537 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 14:43:38,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2024-11-16 14:43:39,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 2578. [2024-11-16 14:43:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2578 states, 1874 states have (on average 1.3847385272145145) internal successors, (2595), 1894 states have internal predecessors, (2595), 649 states have call successors, (649), 54 states have call predecessors, (649), 54 states have return successors, (649), 629 states have call predecessors, (649), 649 states have call successors, (649) [2024-11-16 14:43:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 3893 transitions. [2024-11-16 14:43:39,090 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 3893 transitions. Word has length 201 [2024-11-16 14:43:39,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:39,091 INFO L471 AbstractCegarLoop]: Abstraction has 2578 states and 3893 transitions. [2024-11-16 14:43:39,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3893 transitions. [2024-11-16 14:43:39,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-16 14:43:39,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:39,095 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:39,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 14:43:39,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:39,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:39,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1420715998, now seen corresponding path program 1 times [2024-11-16 14:43:39,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:39,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655674482] [2024-11-16 14:43:39,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:39,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:43:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:43:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:43:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:43:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:43:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:43:39,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 14:43:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:43:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:43:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 14:43:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:43:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:43:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:43:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:43:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:43:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:43:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:43:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:43:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:43:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:43:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:43:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:43:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:43:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:43:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:43:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:43:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:43:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-16 14:43:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:43:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:43:39,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 14:43:39,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:43:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655674482] [2024-11-16 14:43:39,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655674482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:43:39,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:43:39,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:43:39,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660705025] [2024-11-16 14:43:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:43:39,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:43:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:43:39,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:43:39,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:39,259 INFO L87 Difference]: Start difference. First operand 2578 states and 3893 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:43:39,581 INFO L93 Difference]: Finished difference Result 6419 states and 9724 transitions. [2024-11-16 14:43:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:43:39,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 201 [2024-11-16 14:43:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:43:39,619 INFO L225 Difference]: With dead ends: 6419 [2024-11-16 14:43:39,619 INFO L226 Difference]: Without dead ends: 4088 [2024-11-16 14:43:39,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:43:39,631 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 149 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:43:39,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 305 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:43:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4088 states. [2024-11-16 14:43:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4088 to 4085. [2024-11-16 14:43:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4085 states, 2971 states have (on average 1.371255469538876) internal successors, (4074), 3006 states have internal predecessors, (4074), 1029 states have call successors, (1029), 84 states have call predecessors, (1029), 84 states have return successors, (1029), 994 states have call predecessors, (1029), 1029 states have call successors, (1029) [2024-11-16 14:43:40,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 6132 transitions. [2024-11-16 14:43:40,072 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 6132 transitions. Word has length 201 [2024-11-16 14:43:40,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:43:40,073 INFO L471 AbstractCegarLoop]: Abstraction has 4085 states and 6132 transitions. [2024-11-16 14:43:40,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-16 14:43:40,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 6132 transitions. [2024-11-16 14:43:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-16 14:43:40,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:43:40,077 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:40,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 14:43:40,077 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:43:40,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:43:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1976371684, now seen corresponding path program 1 times [2024-11-16 14:43:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:43:40,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150828083] [2024-11-16 14:43:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:43:40,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:43:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:43:40,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 14:43:40,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:43:40,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 14:43:40,322 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 14:43:40,324 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 14:43:40,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 14:43:40,329 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:43:40,479 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 14:43:40,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:43:40 BoogieIcfgContainer [2024-11-16 14:43:40,484 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 14:43:40,485 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 14:43:40,485 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 14:43:40,485 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 14:43:40,485 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:43:27" (3/4) ... [2024-11-16 14:43:40,488 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 14:43:40,489 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 14:43:40,490 INFO L158 Benchmark]: Toolchain (without parser) took 14459.69ms. Allocated memory was 140.5MB in the beginning and 494.9MB in the end (delta: 354.4MB). Free memory was 70.7MB in the beginning and 364.1MB in the end (delta: -293.4MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2024-11-16 14:43:40,490 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 140.5MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:43:40,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.79ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 70.6MB in the beginning and 156.1MB in the end (delta: -85.5MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-11-16 14:43:40,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.78ms. Allocated memory is still 186.6MB. Free memory was 156.1MB in the beginning and 151.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 14:43:40,491 INFO L158 Benchmark]: Boogie Preprocessor took 94.29ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 146.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 14:43:40,491 INFO L158 Benchmark]: IcfgBuilder took 754.87ms. Allocated memory is still 186.6MB. Free memory was 146.6MB in the beginning and 115.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 14:43:40,492 INFO L158 Benchmark]: TraceAbstraction took 13021.03ms. Allocated memory was 186.6MB in the beginning and 494.9MB in the end (delta: 308.3MB). Free memory was 115.2MB in the beginning and 365.1MB in the end (delta: -250.0MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. [2024-11-16 14:43:40,492 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 494.9MB. Free memory is still 364.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:43:40,493 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.24ms. Allocated memory is still 140.5MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.79ms. Allocated memory was 140.5MB in the beginning and 186.6MB in the end (delta: 46.1MB). Free memory was 70.6MB in the beginning and 156.1MB in the end (delta: -85.5MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.78ms. Allocated memory is still 186.6MB. Free memory was 156.1MB in the beginning and 151.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.29ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 146.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 754.87ms. Allocated memory is still 186.6MB. Free memory was 146.6MB in the beginning and 115.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 13021.03ms. Allocated memory was 186.6MB in the beginning and 494.9MB in the end (delta: 308.3MB). Free memory was 115.2MB in the beginning and 365.1MB in the end (delta: -250.0MB). Peak memory consumption was 58.3MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 494.9MB. Free memory is still 364.1MB. 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 196, overapproximation of bitwiseAnd at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryArithmeticFLOAToperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_4 = 100; [L24] unsigned char var_1_5 = 2; [L25] unsigned char var_1_6 = 64; [L26] unsigned char var_1_7 = 32; [L27] unsigned char var_1_8 = 32; [L28] float var_1_9 = 100.5; [L29] float var_1_11 = 0.8; [L30] float var_1_12 = 2.5; [L31] signed short int var_1_13 = -32; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] float var_1_18 = 0.25; [L36] float var_1_19 = 100000000.25; [L37] signed char var_1_20 = 0; [L38] signed char var_1_21 = 10; [L39] double var_1_22 = 1000000.5; [L40] unsigned long int var_1_23 = 256; [L41] unsigned long int var_1_24 = 50; [L42] signed long int var_1_25 = 64; [L43] unsigned long int var_1_29 = 32; [L44] unsigned long int var_1_32 = 2219578776; [L45] unsigned char var_1_34 = 0; [L46] unsigned char var_1_35 = 0; [L47] unsigned char var_1_36 = 5; [L48] float var_1_37 = 256.125; [L49] float var_1_38 = 127.25; [L50] unsigned char var_1_41 = 32; [L51] double var_1_42 = 16.125; [L52] double var_1_43 = 256.5; [L53] signed short int var_1_45 = -10; [L54] unsigned char last_1_var_1_1 = 2; [L55] unsigned char last_1_var_1_15 = 1; [L56] signed char last_1_var_1_20 = 0; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L191] last_1_var_1_1 = var_1_1 [L192] last_1_var_1_15 = var_1_15 [L193] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L203] RET updateLastVariables() [L204] CALL updateVariables() [L143] var_1_4 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L144] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L145] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L146] var_1_5 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L147] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L148] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L149] var_1_6 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L150] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L151] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L151] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L152] var_1_7 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_8=32, var_1_9=201/2] [L153] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_8=32, var_1_9=201/2] [L154] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L154] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L155] var_1_8 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_9=201/2] [L156] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_9=201/2] [L157] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L157] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L158] var_1_11 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L159] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=5/2, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L160] var_1_12 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L161] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L162] var_1_16 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L163] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L164] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L164] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L165] var_1_17 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L166] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L167] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L167] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L168] var_1_19 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L169] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L170] var_1_21 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L171] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L172] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L172] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=32, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L173] var_1_29 = __VERIFIER_nondet_ulong() [L174] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L174] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L175] CALL assume_abort_if_not(var_1_29 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L175] RET assume_abort_if_not(var_1_29 <= 32) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2219578776, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L176] var_1_32 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_32 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L177] RET assume_abort_if_not(var_1_32 >= 2147483647) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L178] CALL assume_abort_if_not(var_1_32 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L178] RET assume_abort_if_not(var_1_32 <= 4294967295) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L179] var_1_35 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L180] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L181] CALL assume_abort_if_not(var_1_35 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L181] RET assume_abort_if_not(var_1_35 <= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_37=2049/8, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L182] var_1_37 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L183] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_38=509/4, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L184] var_1_38 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L185] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854776000e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_42=129/8, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L186] var_1_42 = __VERIFIER_nondet_double() [L187] CALL assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L187] RET assume_abort_if_not((var_1_42 >= -922337.2036854776000e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854776000e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L188] CALL assume_abort_if_not(var_1_42 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L188] RET assume_abort_if_not(var_1_42 != 0.0F) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L204] RET updateVariables() [L205] CALL step() [L60] COND FALSE !(var_1_5 >= var_1_6) [L69] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L71] unsigned char stepLocal_1 = var_1_15; [L72] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_0=-255, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L73] COND TRUE var_1_17 || stepLocal_0 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, stepLocal_1=-255, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L74] COND TRUE var_1_15 && stepLocal_1 [L75] var_1_18 = (var_1_11 + var_1_19) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L80] EXPR var_1_20 >> var_1_29 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L80] EXPR ((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L80] EXPR var_1_20 >> var_1_29 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L80] EXPR ((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L80] COND TRUE var_1_13 < ((((var_1_1) < ((var_1_20 >> var_1_29))) ? (var_1_1) : ((var_1_20 >> var_1_29)))) [L81] COND FALSE !(var_1_13 > var_1_1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L84] EXPR var_1_29 ^ var_1_20 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L84] EXPR (var_1_29 ^ var_1_20) >> var_1_13 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L84] COND FALSE !(((var_1_29 ^ var_1_20) >> var_1_13) > ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) [L95] COND FALSE !((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=32, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L104] COND TRUE (var_1_38 / ((((var_1_42) > (256.5)) ? (var_1_42) : (256.5)))) < var_1_37 [L105] var_1_41 = var_1_29 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L107] COND FALSE !(var_1_11 == var_1_18) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L110] COND FALSE !(var_1_23 >= -25) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L113] COND TRUE (var_1_37 - var_1_38) >= (var_1_18 * var_1_22) [L114] var_1_36 = 5 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L116] COND FALSE !((((((var_1_22) < (var_1_37)) ? (var_1_22) : (var_1_37))) >= (var_1_38 / var_1_42)) || var_1_35) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L121] EXPR var_1_13 & var_1_24 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L121] EXPR var_1_20 ^ (var_1_13 & var_1_24) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L121] COND TRUE var_1_29 <= (var_1_20 ^ (var_1_13 & var_1_24)) [L122] COND FALSE !(\read(var_1_35)) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L130] COND FALSE !(-32 < var_1_13) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=201/2] [L133] COND FALSE !((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) [L136] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=2219578781] [L138] var_1_22 = var_1_12 [L139] var_1_23 = var_1_8 [L140] var_1_24 = var_1_6 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=2219578781] [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return (((((((((-32 < var_1_13) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_13 + ((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_18) < (var_1_11)) ? (var_1_18) : (var_1_11)))) > (- var_1_18)) ? ((var_1_6 <= var_1_8) ? (var_1_15 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((last_1_var_1_1 <= last_1_var_1_20) ? (var_1_15 == ((unsigned char) var_1_16)) : ((last_1_var_1_15 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_15) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=2219578781] [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=2219578781] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_1=2, last_1_var_1_20=0, var_1_12=2219578781, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_1=2, var_1_20=0, var_1_21=-1, var_1_22=2219578781, var_1_23=0, var_1_24=64, var_1_25=64, var_1_29=0, var_1_32=2147483647, var_1_34=0, var_1_35=0, var_1_36=5, var_1_41=0, var_1_43=513/2, var_1_45=-10, var_1_4=48991, var_1_5=-256, var_1_6=64, var_1_7=64, var_1_8=0, var_1_9=2219578781] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 14, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1668 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1654 mSDsluCounter, 4931 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2732 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1284 IncrementalHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 2199 mSDtfsCounter, 1284 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1241 GetRequests, 1203 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4085occurred in iteration=13, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 785 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2964 NumberOfCodeBlocks, 2964 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2948 ConstructedInterpolants, 0 QuantifiedInterpolants, 9331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 466 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 24234/24360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 14:43:40,528 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_fillercode_fillercodestructure_filler-pr-co_file-32.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 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:43:42,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:43:42,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 14:43:42,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:43:42,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:43:43,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:43:43,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:43:43,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:43:43,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:43:43,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:43:43,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:43:43,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:43:43,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:43:43,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:43:43,047 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:43:43,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:43:43,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:43:43,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:43:43,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:43:43,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:43:43,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:43:43,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:43:43,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:43:43,054 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 14:43:43,054 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 14:43:43,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:43:43,054 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 14:43:43,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:43:43,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:43:43,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:43:43,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:43:43,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:43:43,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:43:43,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:43:43,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:43:43,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:43:43,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:43:43,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:43:43,059 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 14:43:43,059 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 14:43:43,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:43:43,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:43:43,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:43:43,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:43:43,060 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 -> 3ac81a8cacda8462923d09d15f8ac5e71885bebbafc1cfaa52b22f9f8f380889 [2024-11-16 14:43:43,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:43:43,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:43:43,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:43:43,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:43:43,460 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:43:43,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-11-16 14:43:45,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:43:45,438 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:43:45,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-11-16 14:43:45,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab3932f6/50dcf00b3f014475a4641b49829fe7b2/FLAG917032ed6 [2024-11-16 14:43:45,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ab3932f6/50dcf00b3f014475a4641b49829fe7b2 [2024-11-16 14:43:45,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:43:45,746 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:43:45,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:43:45,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:43:45,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:43:45,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:43:45" (1/1) ... [2024-11-16 14:43:45,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@459612e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:45, skipping insertion in model container [2024-11-16 14:43:45,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:43:45" (1/1) ... [2024-11-16 14:43:45,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:43:45,968 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_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2024-11-16 14:43:46,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:43:46,092 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:43:46,108 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_fillercode_fillercodestructure_filler-pr-co_file-32.i[919,932] [2024-11-16 14:43:46,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:43:46,184 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:43:46,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46 WrapperNode [2024-11-16 14:43:46,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:43:46,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:43:46,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:43:46,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:43:46,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,247 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-11-16 14:43:46,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:43:46,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:43:46,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:43:46,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:43:46,260 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,290 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 14:43:46,290 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,290 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,319 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:43:46,334 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:43:46,335 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:43:46,335 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:43:46,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (1/1) ... [2024-11-16 14:43:46,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:43:46,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:43:46,378 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 14:43:46,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 14:43:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:43:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 14:43:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:43:46,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:43:46,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:43:46,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:43:46,529 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:43:46,532 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:44:15,984 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 14:44:15,986 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:44:16,001 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:44:16,001 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:44:16,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:44:16 BoogieIcfgContainer [2024-11-16 14:44:16,002 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:44:16,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:44:16,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:44:16,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:44:16,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:43:45" (1/3) ... [2024-11-16 14:44:16,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38351282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:44:16, skipping insertion in model container [2024-11-16 14:44:16,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:43:46" (2/3) ... [2024-11-16 14:44:16,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38351282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:44:16, skipping insertion in model container [2024-11-16 14:44:16,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:44:16" (3/3) ... [2024-11-16 14:44:16,012 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-32.i [2024-11-16 14:44:16,035 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:44:16,035 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:44:16,095 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:44:16,106 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;@92646b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:44:16,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:44:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 14:44:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-16 14:44:16,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:44:16,134 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:44:16,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:44:16,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:44:16,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1646902899, now seen corresponding path program 1 times [2024-11-16 14:44:16,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:44:16,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003487947] [2024-11-16 14:44:16,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:44:16,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:44:16,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:44:16,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:44:16,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 14:44:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:44:18,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 14:44:18,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:44:18,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-11-16 14:44:18,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:44:18,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:44:18,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003487947] [2024-11-16 14:44:18,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003487947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:44:18,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:44:18,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:44:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603890390] [2024-11-16 14:44:18,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:44:18,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:44:18,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:44:18,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:44:18,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:44:18,278 INFO L87 Difference]: Start difference. First operand has 93 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 14:44:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:44:18,364 INFO L93 Difference]: Finished difference Result 178 states and 316 transitions. [2024-11-16 14:44:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:44:18,367 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 188 [2024-11-16 14:44:18,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:44:18,388 INFO L225 Difference]: With dead ends: 178 [2024-11-16 14:44:18,389 INFO L226 Difference]: Without dead ends: 88 [2024-11-16 14:44:18,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:44:18,405 INFO L432 NwaCegarLoop]: 139 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, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:44:18,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:44:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-16 14:44:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-16 14:44:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 57 states have internal predecessors, (81), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-16 14:44:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 139 transitions. [2024-11-16 14:44:18,463 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 139 transitions. Word has length 188 [2024-11-16 14:44:18,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:44:18,464 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 139 transitions. [2024-11-16 14:44:18,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-16 14:44:18,464 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 139 transitions. [2024-11-16 14:44:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-16 14:44:18,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:44:18,470 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:44:18,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 14:44:18,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:44:18,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:44:18,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:44:18,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1415190456, now seen corresponding path program 1 times [2024-11-16 14:44:18,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:44:18,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1031690257] [2024-11-16 14:44:18,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:44:18,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:44:18,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:44:18,676 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:44:18,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 14:44:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:44:20,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 14:44:20,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:44:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 840 proven. 42 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2024-11-16 14:44:25,028 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:44:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-16 14:44:29,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:44:29,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1031690257] [2024-11-16 14:44:29,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1031690257] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:44:29,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:44:29,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-16 14:44:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92458037] [2024-11-16 14:44:29,545 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:44:29,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 14:44:29,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:44:29,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 14:44:29,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:44:29,551 INFO L87 Difference]: Start difference. First operand 88 states and 139 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-16 14:44:38,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:44:41,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:44:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:44:42,754 INFO L93 Difference]: Finished difference Result 206 states and 321 transitions. [2024-11-16 14:44:42,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 14:44:42,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 188 [2024-11-16 14:44:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:44:42,758 INFO L225 Difference]: With dead ends: 206 [2024-11-16 14:44:42,758 INFO L226 Difference]: Without dead ends: 121 [2024-11-16 14:44:42,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 14:44:42,762 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 78 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2024-11-16 14:44:42,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 338 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 279 Invalid, 1 Unknown, 0 Unchecked, 12.6s Time] [2024-11-16 14:44:42,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-16 14:44:42,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2024-11-16 14:44:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 71 states have internal predecessors, (93), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-16 14:44:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 179 transitions. [2024-11-16 14:44:42,791 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 179 transitions. Word has length 188 [2024-11-16 14:44:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:44:42,792 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 179 transitions. [2024-11-16 14:44:42,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-16 14:44:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 179 transitions. [2024-11-16 14:44:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-16 14:44:42,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:44:42,796 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:44:42,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 14:44:43,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:44:43,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:44:43,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:44:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1034673464, now seen corresponding path program 1 times [2024-11-16 14:44:43,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:44:43,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534875509] [2024-11-16 14:44:43,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:44:43,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:44:43,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:44:43,005 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:44:43,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 14:44:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:44:44,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 14:44:44,664 INFO L278 TraceCheckSpWp]: Computing forward predicates...