./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.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 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:40:11,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:40:11,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 04:40:11,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:40:11,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:40:11,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:40:11,816 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:40:11,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:40:11,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:40:11,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:40:11,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:40:11,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:40:11,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:40:11,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:40:11,819 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:40:11,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:40:11,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:40:11,825 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:40:11,826 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 04:40:11,826 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:40:11,826 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:40:11,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:40:11,828 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:40:11,828 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:40:11,828 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:40:11,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:40:11,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:40:11,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:40:11,830 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:40:11,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:40:11,830 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:40:11,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:40:11,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:40:11,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:40:11,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:40:11,831 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:40:11,831 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 04:40:11,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 04:40:11,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:40:11,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:40:11,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:40:11,834 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:40:11,834 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 -> 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 [2024-11-20 04:40:12,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:40:12,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:40:12,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:40:12,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:40:12,115 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:40:12,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2024-11-20 04:40:13,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:40:13,818 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:40:13,819 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2024-11-20 04:40:13,829 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fefd689df/fa12ac54a44b48a58489987e3bb6b42b/FLAG9803dc809 [2024-11-20 04:40:13,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fefd689df/fa12ac54a44b48a58489987e3bb6b42b [2024-11-20 04:40:13,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:40:13,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:40:13,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:40:13,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:40:13,858 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:40:13,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:40:13" (1/1) ... [2024-11-20 04:40:13,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@146ce15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:13, skipping insertion in model container [2024-11-20 04:40:13,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:40:13" (1/1) ... [2024-11-20 04:40:13,899 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:40:14,097 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-ci_file-80.i[919,932] [2024-11-20 04:40:14,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:40:14,218 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:40:14,230 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-ci_file-80.i[919,932] [2024-11-20 04:40:14,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:40:14,288 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:40:14,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14 WrapperNode [2024-11-20 04:40:14,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:40:14,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:40:14,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:40:14,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:40:14,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,313 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,353 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2024-11-20 04:40:14,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:40:14,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:40:14,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:40:14,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:40:14,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,404 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-20 04:40:14,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,423 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:40:14,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:40:14,438 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:40:14,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:40:14,440 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (1/1) ... [2024-11-20 04:40:14,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:40:14,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:40:14,480 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-20 04:40:14,484 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-20 04:40:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:40:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:40:14,520 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:40:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 04:40:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:40:14,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:40:14,593 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:40:14,596 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:40:15,080 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 04:40:15,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:40:15,102 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:40:15,104 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:40:15,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:40:15 BoogieIcfgContainer [2024-11-20 04:40:15,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:40:15,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:40:15,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:40:15,111 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:40:15,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:40:13" (1/3) ... [2024-11-20 04:40:15,112 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5554d46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:40:15, skipping insertion in model container [2024-11-20 04:40:15,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:14" (2/3) ... [2024-11-20 04:40:15,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5554d46e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:40:15, skipping insertion in model container [2024-11-20 04:40:15,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:40:15" (3/3) ... [2024-11-20 04:40:15,115 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2024-11-20 04:40:15,134 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:40:15,135 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:40:15,207 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:40:15,214 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;@1edee56f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:40:15,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:40:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 64 states have internal predecessors, (91), 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-20 04:40:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 04:40:15,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:40:15,238 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] [2024-11-20 04:40:15,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:40:15,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:40:15,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1579062022, now seen corresponding path program 1 times [2024-11-20 04:40:15,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:40:15,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72659230] [2024-11-20 04:40:15,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:15,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:40:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:40:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:40:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:40:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 04:40:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 04:40:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:40:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 04:40:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:40:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 04:40:15,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:40:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 04:40:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 04:40:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 04:40:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 04:40:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 04:40:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 04:40:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 04:40:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 04:40:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 04:40:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 04:40:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 04:40:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 04:40:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 04:40:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 04:40:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 04:40:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 04:40:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 04:40:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 04:40:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 04:40:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:15,942 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-20 04:40:15,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:40:15,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72659230] [2024-11-20 04:40:15,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72659230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:40:15,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:40:15,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:40:15,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970701200] [2024-11-20 04:40:15,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:40:15,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 04:40:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:40:15,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 04:40:15,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 04:40:15,983 INFO L87 Difference]: Start difference. First operand has 95 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 64 states have internal predecessors, (91), 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 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-20 04:40:16,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:40:16,038 INFO L93 Difference]: Finished difference Result 183 states and 321 transitions. [2024-11-20 04:40:16,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 04:40:16,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 190 [2024-11-20 04:40:16,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:40:16,052 INFO L225 Difference]: With dead ends: 183 [2024-11-20 04:40:16,053 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 04:40:16,059 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-20 04:40:16,065 INFO L432 NwaCegarLoop]: 142 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, 142 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-20 04:40:16,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:40:16,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 04:40:16,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 04:40:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 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-20 04:40:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 142 transitions. [2024-11-20 04:40:16,126 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 142 transitions. Word has length 190 [2024-11-20 04:40:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:40:16,128 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 142 transitions. [2024-11-20 04:40:16,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-20 04:40:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 142 transitions. [2024-11-20 04:40:16,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 04:40:16,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:40:16,137 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] [2024-11-20 04:40:16,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 04:40:16,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:40:16,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:40:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1855836736, now seen corresponding path program 1 times [2024-11-20 04:40:16,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:40:16,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336834339] [2024-11-20 04:40:16,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:16,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:40:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:40:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:40:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:40:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 04:40:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 04:40:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:40:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 04:40:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:40:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 04:40:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:40:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 04:40:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 04:40:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 04:40:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 04:40:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 04:40:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 04:40:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 04:40:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 04:40:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 04:40:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 04:40:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 04:40:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 04:40:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 04:40:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 04:40:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 04:40:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 04:40:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 04:40:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 04:40:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 04:40:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,566 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-20 04:40:16,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:40:16,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336834339] [2024-11-20 04:40:16,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336834339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:40:16,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:40:16,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:40:16,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545727313] [2024-11-20 04:40:16,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:40:16,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:40:16,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:40:16,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:40:16,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:40:16,576 INFO L87 Difference]: Start difference. First operand 91 states and 142 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 04:40:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:40:16,680 INFO L93 Difference]: Finished difference Result 265 states and 416 transitions. [2024-11-20 04:40:16,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:40:16,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 190 [2024-11-20 04:40:16,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:40:16,688 INFO L225 Difference]: With dead ends: 265 [2024-11-20 04:40:16,688 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 04:40:16,689 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-20 04:40:16,692 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 122 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:40:16,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 357 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:40:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 04:40:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2024-11-20 04:40:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 114 states have (on average 1.368421052631579) internal successors, (156), 114 states have internal predecessors, (156), 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-20 04:40:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 272 transitions. [2024-11-20 04:40:16,743 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 272 transitions. Word has length 190 [2024-11-20 04:40:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:40:16,744 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 272 transitions. [2024-11-20 04:40:16,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 04:40:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 272 transitions. [2024-11-20 04:40:16,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 04:40:16,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:40:16,748 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] [2024-11-20 04:40:16,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 04:40:16,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:40:16,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:40:16,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1046490110, now seen corresponding path program 1 times [2024-11-20 04:40:16,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:40:16,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523497763] [2024-11-20 04:40:16,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:16,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:40:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:40:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:40:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:40:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 04:40:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 04:40:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:40:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:16,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 04:40:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:40:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 04:40:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:40:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 04:40:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 04:40:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 04:40:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 04:40:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 04:40:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 04:40:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 04:40:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 04:40:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 04:40:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 04:40:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 04:40:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 04:40:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 04:40:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 04:40:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 04:40:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 04:40:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 04:40:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 04:40:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 04:40:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,080 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-20 04:40:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:40:17,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523497763] [2024-11-20 04:40:17,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523497763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:40:17,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:40:17,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:40:17,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224264278] [2024-11-20 04:40:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:40:17,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:40:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:40:17,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:40:17,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:40:17,085 INFO L87 Difference]: Start difference. First operand 175 states and 272 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-20 04:40:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:40:17,172 INFO L93 Difference]: Finished difference Result 519 states and 810 transitions. [2024-11-20 04:40:17,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:40:17,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 190 [2024-11-20 04:40:17,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:40:17,177 INFO L225 Difference]: With dead ends: 519 [2024-11-20 04:40:17,177 INFO L226 Difference]: Without dead ends: 347 [2024-11-20 04:40:17,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-20 04:40:17,180 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 137 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:40:17,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 387 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:40:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-20 04:40:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 181. [2024-11-20 04:40:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 120 states have (on average 1.3583333333333334) internal successors, (163), 120 states have internal predecessors, (163), 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-20 04:40:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 279 transitions. [2024-11-20 04:40:17,231 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 279 transitions. Word has length 190 [2024-11-20 04:40:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:40:17,232 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 279 transitions. [2024-11-20 04:40:17,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-20 04:40:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 279 transitions. [2024-11-20 04:40:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 04:40:17,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:40:17,235 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] [2024-11-20 04:40:17,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 04:40:17,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:40:17,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:40:17,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1254332480, now seen corresponding path program 1 times [2024-11-20 04:40:17,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:40:17,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505359238] [2024-11-20 04:40:17,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:17,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:40:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:40:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:40:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:40:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 04:40:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 04:40:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:40:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 04:40:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:40:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 04:40:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:40:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 04:40:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 04:40:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 04:40:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 04:40:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 04:40:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 04:40:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 04:40:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 04:40:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 04:40:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 04:40:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 04:40:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 04:40:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 04:40:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 04:40:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 04:40:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 04:40:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 04:40:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 04:40:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 04:40:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:17,712 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-20 04:40:17,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:40:17,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505359238] [2024-11-20 04:40:17,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505359238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:40:17,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:40:17,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:40:17,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127485391] [2024-11-20 04:40:17,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:40:17,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:40:17,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:40:17,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:40:17,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:40:17,723 INFO L87 Difference]: Start difference. First operand 181 states and 279 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 04:40:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:40:17,825 INFO L93 Difference]: Finished difference Result 450 states and 698 transitions. [2024-11-20 04:40:17,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:40:17,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 190 [2024-11-20 04:40:17,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:40:17,830 INFO L225 Difference]: With dead ends: 450 [2024-11-20 04:40:17,831 INFO L226 Difference]: Without dead ends: 272 [2024-11-20 04:40:17,832 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-20 04:40:17,836 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 82 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:40:17,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 295 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:40:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-20 04:40:17,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2024-11-20 04:40:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 179 states have (on average 1.3463687150837989) internal successors, (241), 179 states have internal predecessors, (241), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-20 04:40:17,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 415 transitions. [2024-11-20 04:40:17,893 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 415 transitions. Word has length 190 [2024-11-20 04:40:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:40:17,896 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 415 transitions. [2024-11-20 04:40:17,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 04:40:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 415 transitions. [2024-11-20 04:40:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-20 04:40:17,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:40:17,901 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] [2024-11-20 04:40:17,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 04:40:17,902 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:40:17,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:40:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1441436734, now seen corresponding path program 1 times [2024-11-20 04:40:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:40:17,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71843692] [2024-11-20 04:40:17,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:40:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:40:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:40:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:40:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 04:40:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 04:40:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:40:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 04:40:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:40:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 04:40:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:40:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 04:40:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 04:40:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 04:40:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 04:40:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 04:40:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 04:40:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 04:40:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 04:40:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 04:40:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 04:40:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 04:40:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 04:40:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 04:40:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 04:40:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 04:40:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 04:40:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 04:40:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 04:40:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 04:40:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,083 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-20 04:40:18,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:40:18,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71843692] [2024-11-20 04:40:18,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71843692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:40:18,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:40:18,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 04:40:18,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789089585] [2024-11-20 04:40:18,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:40:18,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:40:18,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:40:18,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:40:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:40:18,086 INFO L87 Difference]: Start difference. First operand 270 states and 415 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 04:40:18,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:40:18,107 INFO L93 Difference]: Finished difference Result 358 states and 548 transitions. [2024-11-20 04:40:18,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:40:18,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 190 [2024-11-20 04:40:18,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:40:18,109 INFO L225 Difference]: With dead ends: 358 [2024-11-20 04:40:18,109 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 04:40:18,110 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-20 04:40:18,111 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:40:18,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:40:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 04:40:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 04:40:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 60 states have internal predecessors, (77), 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-20 04:40:18,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2024-11-20 04:40:18,126 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 190 [2024-11-20 04:40:18,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:40:18,128 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2024-11-20 04:40:18,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-20 04:40:18,129 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2024-11-20 04:40:18,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-20 04:40:18,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:40:18,131 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-20 04:40:18,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 04:40:18,131 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:40:18,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:40:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1291421829, now seen corresponding path program 1 times [2024-11-20 04:40:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:40:18,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107589921] [2024-11-20 04:40:18,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:18,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:40:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:40:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:40:18,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:40:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 04:40:18,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 04:40:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:40:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 04:40:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:40:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 04:40:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:40:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 04:40:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 04:40:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 04:40:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 04:40:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 04:40:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 04:40:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 04:40:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 04:40:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 04:40:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 04:40:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 04:40:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 04:40:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 04:40:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 04:40:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 04:40:18,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 04:40:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 04:40:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 04:40:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 04:40:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,426 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-20 04:40:18,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:40:18,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107589921] [2024-11-20 04:40:18,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107589921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:40:18,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:40:18,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:40:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057536237] [2024-11-20 04:40:18,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:40:18,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:40:18,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:40:18,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:40:18,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:40:18,429 INFO L87 Difference]: Start difference. First operand 91 states and 135 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-20 04:40:18,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:40:18,501 INFO L93 Difference]: Finished difference Result 179 states and 267 transitions. [2024-11-20 04:40:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:40:18,502 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-20 04:40:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:40:18,503 INFO L225 Difference]: With dead ends: 179 [2024-11-20 04:40:18,503 INFO L226 Difference]: Without dead ends: 91 [2024-11-20 04:40:18,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 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-20 04:40:18,505 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 165 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 04:40:18,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 122 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 04:40:18,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-20 04:40:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-20 04:40:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 60 states have internal predecessors, (76), 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-20 04:40:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 134 transitions. [2024-11-20 04:40:18,519 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 134 transitions. Word has length 192 [2024-11-20 04:40:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:40:18,523 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 134 transitions. [2024-11-20 04:40:18,523 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-20 04:40:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 134 transitions. [2024-11-20 04:40:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 04:40:18,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:40:18,525 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] [2024-11-20 04:40:18,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 04:40:18,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:40:18,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:40:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1328909940, now seen corresponding path program 1 times [2024-11-20 04:40:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:40:18,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308907050] [2024-11-20 04:40:18,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:18,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:40:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:40:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:40:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:40:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 04:40:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 04:40:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:40:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 04:40:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:40:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 04:40:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:40:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 04:40:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 04:40:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 04:40:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 04:40:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 04:40:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 04:40:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 04:40:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 04:40:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 04:40:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 04:40:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 04:40:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 04:40:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 04:40:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 04:40:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 04:40:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 04:40:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 04:40:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 04:40:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 04:40:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:18,763 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-20 04:40:18,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:40:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308907050] [2024-11-20 04:40:18,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308907050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:40:18,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:40:18,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:40:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065961206] [2024-11-20 04:40:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:40:18,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:40:18,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:40:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:40:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:40:18,766 INFO L87 Difference]: Start difference. First operand 91 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-20 04:40:18,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:40:18,808 INFO L93 Difference]: Finished difference Result 180 states and 267 transitions. [2024-11-20 04:40:18,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:40:18,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 193 [2024-11-20 04:40:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:40:18,810 INFO L225 Difference]: With dead ends: 180 [2024-11-20 04:40:18,810 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 04:40:18,811 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-20 04:40:18,811 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 71 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:40:18,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 246 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:40:18,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 04:40:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-20 04:40:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 61 states have internal predecessors, (77), 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-20 04:40:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 135 transitions. [2024-11-20 04:40:18,822 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 135 transitions. Word has length 193 [2024-11-20 04:40:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:40:18,823 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 135 transitions. [2024-11-20 04:40:18,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-20 04:40:18,824 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 135 transitions. [2024-11-20 04:40:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-20 04:40:18,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:40:18,825 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] [2024-11-20 04:40:18,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 04:40:18,826 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:40:18,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:40:18,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1587075378, now seen corresponding path program 1 times [2024-11-20 04:40:18,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:40:18,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323694171] [2024-11-20 04:40:18,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:18,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:40:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:40:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:40:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:40:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 04:40:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 04:40:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:40:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 04:40:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:40:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 04:40:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:40:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 04:40:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 04:40:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 04:40:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 04:40:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 04:40:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 04:40:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 04:40:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 04:40:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 04:40:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 04:40:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 04:40:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 04:40:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 04:40:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 04:40:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 04:40:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 04:40:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 04:40:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 04:40:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 04:40:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:19,310 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-20 04:40:19,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:40:19,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323694171] [2024-11-20 04:40:19,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323694171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:40:19,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:40:19,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 04:40:19,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618731364] [2024-11-20 04:40:19,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:40:19,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 04:40:19,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:40:19,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 04:40:19,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:40:19,314 INFO L87 Difference]: Start difference. First operand 92 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-20 04:40:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:40:19,734 INFO L93 Difference]: Finished difference Result 294 states and 434 transitions. [2024-11-20 04:40:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 04:40:19,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 193 [2024-11-20 04:40:19,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:40:19,737 INFO L225 Difference]: With dead ends: 294 [2024-11-20 04:40:19,737 INFO L226 Difference]: Without dead ends: 205 [2024-11-20 04:40:19,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:40:19,739 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 163 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 04:40:19,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 409 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 04:40:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-20 04:40:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 182. [2024-11-20 04:40:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 121 states have (on average 1.2644628099173554) internal successors, (153), 121 states have internal predecessors, (153), 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-20 04:40:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 269 transitions. [2024-11-20 04:40:19,768 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 269 transitions. Word has length 193 [2024-11-20 04:40:19,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:40:19,769 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 269 transitions. [2024-11-20 04:40:19,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-20 04:40:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 269 transitions. [2024-11-20 04:40:19,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-20 04:40:19,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:40:19,771 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-20 04:40:19,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 04:40:19,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:40:19,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:40:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1610832360, now seen corresponding path program 1 times [2024-11-20 04:40:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:40:19,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812788181] [2024-11-20 04:40:19,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:40:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:40:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:40:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:40:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 04:40:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 04:40:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:40:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 04:40:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:40:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 04:40:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:40:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 04:40:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 04:40:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 04:40:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 04:40:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 04:40:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 04:40:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 04:40:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 04:40:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 04:40:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 04:40:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 04:40:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 04:40:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 04:40:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 04:40:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 04:40:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 04:40:20,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 04:40:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 04:40:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 04:40:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,135 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-20 04:40:20,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:40:20,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812788181] [2024-11-20 04:40:20,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812788181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:40:20,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:40:20,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 04:40:20,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929708933] [2024-11-20 04:40:20,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:40:20,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 04:40:20,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:40:20,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 04:40:20,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 04:40:20,139 INFO L87 Difference]: Start difference. First operand 182 states and 269 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-20 04:40:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:40:20,210 INFO L93 Difference]: Finished difference Result 361 states and 535 transitions. [2024-11-20 04:40:20,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:40:20,210 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-20 04:40:20,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:40:20,212 INFO L225 Difference]: With dead ends: 361 [2024-11-20 04:40:20,213 INFO L226 Difference]: Without dead ends: 182 [2024-11-20 04:40:20,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-20 04:40:20,214 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 129 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 04:40:20,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 239 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 04:40:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-20 04:40:20,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2024-11-20 04:40:20,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 120 states have (on average 1.25) internal successors, (150), 120 states have internal predecessors, (150), 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-20 04:40:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 266 transitions. [2024-11-20 04:40:20,247 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 266 transitions. Word has length 194 [2024-11-20 04:40:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:40:20,247 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 266 transitions. [2024-11-20 04:40:20,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 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-20 04:40:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 266 transitions. [2024-11-20 04:40:20,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-20 04:40:20,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:40:20,250 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-20 04:40:20,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 04:40:20,250 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:40:20,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:40:20,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1868997798, now seen corresponding path program 1 times [2024-11-20 04:40:20,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:40:20,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466671083] [2024-11-20 04:40:20,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:20,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:40:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 04:40:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 04:40:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 04:40:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 04:40:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 04:40:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 04:40:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 04:40:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 04:40:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 04:40:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 04:40:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 04:40:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 04:40:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-20 04:40:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-20 04:40:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-20 04:40:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 04:40:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-20 04:40:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 04:40:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-20 04:40:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 04:40:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 04:40:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 04:40:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-20 04:40:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 04:40:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-20 04:40:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 04:40:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-20 04:40:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-20 04:40:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-20 04:40:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:20,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-20 04:40:20,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 04:40:20,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466671083] [2024-11-20 04:40:20,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466671083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 04:40:20,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871586772] [2024-11-20 04:40:20,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:20,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 04:40:20,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:40:20,923 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-20 04:40:20,945 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-20 04:40:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:40:21,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 04:40:21,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:40:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 534 proven. 15 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2024-11-20 04:40:21,328 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 04:40:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-20 04:40:21,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871586772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 04:40:21,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 04:40:21,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2024-11-20 04:40:21,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317008422] [2024-11-20 04:40:21,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 04:40:21,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 04:40:21,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 04:40:21,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 04:40:21,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-20 04:40:21,639 INFO L87 Difference]: Start difference. First operand 181 states and 266 transitions. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 5 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) [2024-11-20 04:40:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:40:22,577 INFO L93 Difference]: Finished difference Result 461 states and 658 transitions. [2024-11-20 04:40:22,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-20 04:40:22,578 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 5 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) Word has length 194 [2024-11-20 04:40:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:40:22,580 INFO L225 Difference]: With dead ends: 461 [2024-11-20 04:40:22,580 INFO L226 Difference]: Without dead ends: 283 [2024-11-20 04:40:22,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 445 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-20 04:40:22,582 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 439 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 04:40:22,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 566 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 04:40:22,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-20 04:40:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 267. [2024-11-20 04:40:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 190 states have (on average 1.236842105263158) internal successors, (235), 192 states have internal predecessors, (235), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-20 04:40:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 375 transitions. [2024-11-20 04:40:22,638 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 375 transitions. Word has length 194 [2024-11-20 04:40:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:40:22,639 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 375 transitions. [2024-11-20 04:40:22,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 5 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) [2024-11-20 04:40:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 375 transitions. [2024-11-20 04:40:22,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-20 04:40:22,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:40:22,642 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] [2024-11-20 04:40:22,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 04:40:22,843 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,SelfDestructingSolverStorable9 [2024-11-20 04:40:22,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:40:22,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:40:22,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1354482213, now seen corresponding path program 1 times [2024-11-20 04:40:22,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 04:40:22,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564652969] [2024-11-20 04:40:22,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:40:22,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 04:40:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:40:22,975 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 04:40:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 04:40:23,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 04:40:23,145 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 04:40:23,146 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 04:40:23,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 04:40:23,151 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 04:40:23,280 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 04:40:23,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 04:40:23 BoogieIcfgContainer [2024-11-20 04:40:23,283 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 04:40:23,283 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 04:40:23,284 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 04:40:23,284 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 04:40:23,284 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:40:15" (3/4) ... [2024-11-20 04:40:23,287 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 04:40:23,288 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 04:40:23,288 INFO L158 Benchmark]: Toolchain (without parser) took 9439.51ms. Allocated memory was 174.1MB in the beginning and 312.5MB in the end (delta: 138.4MB). Free memory was 107.2MB in the beginning and 220.9MB in the end (delta: -113.7MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-20 04:40:23,289 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 96.5MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:40:23,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.98ms. Allocated memory is still 174.1MB. Free memory was 106.8MB in the beginning and 137.6MB in the end (delta: -30.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-20 04:40:23,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.99ms. Allocated memory is still 174.1MB. Free memory was 137.6MB in the beginning and 132.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 04:40:23,289 INFO L158 Benchmark]: Boogie Preprocessor took 83.35ms. Allocated memory is still 174.1MB. Free memory was 132.9MB in the beginning and 125.1MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 04:40:23,290 INFO L158 Benchmark]: RCFGBuilder took 666.23ms. Allocated memory is still 174.1MB. Free memory was 125.1MB in the beginning and 97.0MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-20 04:40:23,290 INFO L158 Benchmark]: TraceAbstraction took 8175.95ms. Allocated memory was 174.1MB in the beginning and 312.5MB in the end (delta: 138.4MB). Free memory was 96.4MB in the beginning and 220.9MB in the end (delta: -124.6MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2024-11-20 04:40:23,290 INFO L158 Benchmark]: Witness Printer took 4.51ms. Allocated memory is still 312.5MB. Free memory is still 220.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 04:40:23,291 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.08ms. Allocated memory is still 96.5MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 436.98ms. Allocated memory is still 174.1MB. Free memory was 106.8MB in the beginning and 137.6MB in the end (delta: -30.8MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.99ms. Allocated memory is still 174.1MB. Free memory was 137.6MB in the beginning and 132.9MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.35ms. Allocated memory is still 174.1MB. Free memory was 132.9MB in the beginning and 125.1MB in the end (delta: 7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 666.23ms. Allocated memory is still 174.1MB. Free memory was 125.1MB in the beginning and 97.0MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 8175.95ms. Allocated memory was 174.1MB in the beginning and 312.5MB in the end (delta: 138.4MB). Free memory was 96.4MB in the beginning and 220.9MB in the end (delta: -124.6MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Witness Printer took 4.51ms. Allocated memory is still 312.5MB. Free memory is still 220.9MB. 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 180, overapproximation of someBinaryArithmeticDOUBLEoperation at line 83, overapproximation of bitwiseAnd at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 180. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] float var_1_24 = 9999999999.375; [L43] double var_1_28 = 9.25; [L44] double var_1_29 = 0.0; [L45] double var_1_30 = 127.6; [L46] unsigned long int var_1_32 = 128; [L47] unsigned long int var_1_34 = 1089279310; [L48] unsigned long int var_1_35 = 1307137784; [L49] unsigned long int var_1_36 = 1417807175; [L50] unsigned long int var_1_38 = 2; [L51] unsigned short int var_1_40 = 5; [L52] unsigned char var_1_44 = 5; [L53] unsigned char var_1_46 = 16; [L54] unsigned char last_1_var_1_10 = 200; VAL [isInitial=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_2=97/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L177] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_2=97/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L127] var_1_2 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L128] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_3=257/2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L129] var_1_3 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L130] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L131] var_1_4 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L132] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_5=99/2, var_1_9=-25] [L133] var_1_5 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L134] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L135] var_1_11 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L136] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L137] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L137] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L138] var_1_12 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L139] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L140] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L140] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L141] var_1_13 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L142] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L143] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L143] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L144] var_1_15 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L145] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L146] var_1_16 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L147] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L148] var_1_17 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L149] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L150] var_1_20 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L152] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L152] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L153] var_1_21 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L154] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L155] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L155] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L156] var_1_23 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L157] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L158] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L158] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_29=0, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L159] var_1_29 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L160] RET assume_abort_if_not((var_1_29 >= 2305843.009213691390e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 4611686.018427382800e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_30=638/5, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L161] var_1_30 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L162] RET assume_abort_if_not((var_1_30 >= 0.0F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 2305843.009213691390e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1089279310, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L163] var_1_34 = __VERIFIER_nondet_ulong() [L164] CALL assume_abort_if_not(var_1_34 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L164] RET assume_abort_if_not(var_1_34 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L165] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L165] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=1307137784, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L166] var_1_35 = __VERIFIER_nondet_ulong() [L167] CALL assume_abort_if_not(var_1_35 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L167] RET assume_abort_if_not(var_1_35 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L168] CALL assume_abort_if_not(var_1_35 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L168] RET assume_abort_if_not(var_1_35 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=1417807175, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L169] var_1_36 = __VERIFIER_nondet_ulong() [L170] CALL assume_abort_if_not(var_1_36 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L170] RET assume_abort_if_not(var_1_36 >= 1073741824) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L171] CALL assume_abort_if_not(var_1_36 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L171] RET assume_abort_if_not(var_1_36 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=16, var_1_9=-25] [L172] var_1_46 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_46 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L173] RET assume_abort_if_not(var_1_46 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_9=-25] [L174] CALL assume_abort_if_not(var_1_46 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L174] RET assume_abort_if_not(var_1_46 <= 127) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L188] RET updateVariables() [L189] CALL step() [L58] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-25] [L59] COND TRUE stepLocal_0 >= last_1_var_1_10 [L60] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L64] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L67] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L68] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L71] EXPR var_1_10 & var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=5, var_1_46=127, var_1_9=-56] [L71] COND TRUE -32 < (var_1_10 & var_1_12) [L72] var_1_44 = ((((var_1_12) < ((var_1_46 + 10))) ? (var_1_12) : ((var_1_46 + 10)))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L76] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L79] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L80] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_28=37/4, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L83] var_1_28 = ((8.18603254193775E18 - (var_1_29 - var_1_30)) - var_1_16) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L84] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L85] var_1_1 = ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L89] EXPR var_1_9 & var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L89] COND FALSE !((var_1_9 & var_1_18) >= -2) [L92] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L95] COND FALSE !((((((var_1_30 * var_1_17)) < (var_1_29)) ? ((var_1_30 * var_1_17)) : (var_1_29))) >= (- var_1_16)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L102] COND FALSE !(\read(var_1_19)) [L105] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L107] EXPR var_1_35 | var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L107] COND FALSE !((var_1_35 | var_1_10) > var_1_18) [L118] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L119] COND TRUE ((var_1_15 - var_1_16) - var_1_17) <= var_1_13 [L120] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L189] RET step() [L190] CALL, EXPR property() [L180-L181] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=0, var_1_11=1, var_1_12=0, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=0, var_1_23=-56, var_1_24=79999999995/8, var_1_32=128, var_1_34=1073741823, var_1_35=-2147483649, var_1_36=2147483647, var_1_38=2, var_1_40=5, var_1_44=0, var_1_46=127, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 11, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1354 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1308 mSDsluCounter, 3027 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1597 mSDsCounter, 290 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 915 IncrementalHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 290 mSolverCounterUnsat, 1430 mSDtfsCounter, 915 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1064 GetRequests, 1015 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=270occurred in iteration=4, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 210 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2305 NumberOfCodeBlocks, 2305 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2292 ConstructedInterpolants, 0 QuantifiedInterpolants, 6312 SizeOfPredicates, 3 NumberOfNonLiveVariables, 436 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 19443/19488 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-20 04:40:23,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.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 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 04:40:25,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 04:40:25,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 04:40:25,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 04:40:25,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 04:40:25,733 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 04:40:25,734 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 04:40:25,734 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 04:40:25,735 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 04:40:25,735 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 04:40:25,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 04:40:25,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 04:40:25,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 04:40:25,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 04:40:25,742 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 04:40:25,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 04:40:25,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 04:40:25,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 04:40:25,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 04:40:25,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 04:40:25,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 04:40:25,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 04:40:25,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 04:40:25,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 04:40:25,747 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 04:40:25,747 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 04:40:25,747 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 04:40:25,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 04:40:25,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 04:40:25,748 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 04:40:25,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 04:40:25,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 04:40:25,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 04:40:25,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 04:40:25,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:40:25,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 04:40:25,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 04:40:25,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 04:40:25,751 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 04:40:25,751 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 04:40:25,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 04:40:25,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 04:40:25,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 04:40:25,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 04:40:25,753 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 -> 8f27fb34f402b9a11855b517957953eefe825c2ac20a4109c7810b48044f1231 [2024-11-20 04:40:26,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 04:40:26,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 04:40:26,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 04:40:26,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 04:40:26,131 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 04:40:26,132 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2024-11-20 04:40:27,744 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 04:40:27,994 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 04:40:27,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2024-11-20 04:40:28,012 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23c77141/c2af68840d994c57b52ce2fbcd6e2da3/FLAG5bb7e3ac1 [2024-11-20 04:40:28,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a23c77141/c2af68840d994c57b52ce2fbcd6e2da3 [2024-11-20 04:40:28,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 04:40:28,354 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 04:40:28,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 04:40:28,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 04:40:28,362 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 04:40:28,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2db961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28, skipping insertion in model container [2024-11-20 04:40:28,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 04:40:28,599 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-ci_file-80.i[919,932] [2024-11-20 04:40:28,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:40:28,713 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 04:40:28,727 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-ci_file-80.i[919,932] [2024-11-20 04:40:28,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 04:40:28,807 INFO L204 MainTranslator]: Completed translation [2024-11-20 04:40:28,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28 WrapperNode [2024-11-20 04:40:28,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 04:40:28,808 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 04:40:28,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 04:40:28,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 04:40:28,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,837 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,879 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2024-11-20 04:40:28,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 04:40:28,880 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 04:40:28,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 04:40:28,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 04:40:28,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,924 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-20 04:40:28,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 04:40:28,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 04:40:28,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 04:40:28,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 04:40:28,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (1/1) ... [2024-11-20 04:40:28,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 04:40:29,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 04:40:29,024 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-20 04:40:29,031 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-20 04:40:29,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 04:40:29,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 04:40:29,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 04:40:29,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 04:40:29,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 04:40:29,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 04:40:29,183 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 04:40:29,188 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 04:41:01,624 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-20 04:41:01,625 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 04:41:01,639 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 04:41:01,640 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 04:41:01,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:41:01 BoogieIcfgContainer [2024-11-20 04:41:01,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 04:41:01,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 04:41:01,647 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 04:41:01,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 04:41:01,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 04:40:28" (1/3) ... [2024-11-20 04:41:01,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191edb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:41:01, skipping insertion in model container [2024-11-20 04:41:01,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 04:40:28" (2/3) ... [2024-11-20 04:41:01,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@191edb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 04:41:01, skipping insertion in model container [2024-11-20 04:41:01,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 04:41:01" (3/3) ... [2024-11-20 04:41:01,656 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-80.i [2024-11-20 04:41:01,671 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 04:41:01,671 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 04:41:01,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 04:41:01,748 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;@5542eb4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 04:41:01,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 04:41:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 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-20 04:41:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-20 04:41:01,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:41:01,773 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] [2024-11-20 04:41:01,774 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:41:01,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:41:01,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1898754118, now seen corresponding path program 1 times [2024-11-20 04:41:01,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:41:01,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142617245] [2024-11-20 04:41:01,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:41:01,799 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-20 04:41:01,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:41:01,802 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-20 04:41:01,804 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-20 04:41:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:41:03,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 04:41:03,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:41:07,727 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-20 04:41:07,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:41:07,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:41:07,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142617245] [2024-11-20 04:41:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142617245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:41:07,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:41:07,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 04:41:07,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402232259] [2024-11-20 04:41:07,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:41:07,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 04:41:07,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:41:07,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 04:41:07,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:41:07,760 INFO L87 Difference]: Start difference. First operand has 86 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 55 states have internal predecessors, (76), 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 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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-20 04:41:12,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:41:16,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 04:41:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:41:16,464 INFO L93 Difference]: Finished difference Result 242 states and 444 transitions. [2024-11-20 04:41:16,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 04:41:16,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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 187 [2024-11-20 04:41:16,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:41:16,476 INFO L225 Difference]: With dead ends: 242 [2024-11-20 04:41:16,476 INFO L226 Difference]: Without dead ends: 159 [2024-11-20 04:41:16,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 04:41:16,482 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 31 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 8 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-20 04:41:16,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 253 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 12 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-20 04:41:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-20 04:41:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2024-11-20 04:41:16,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.28125) internal successors, (123), 96 states have internal predecessors, (123), 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-20 04:41:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 239 transitions. [2024-11-20 04:41:16,571 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 239 transitions. Word has length 187 [2024-11-20 04:41:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:41:16,577 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 239 transitions. [2024-11-20 04:41:16,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 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-20 04:41:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 239 transitions. [2024-11-20 04:41:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-20 04:41:16,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:41:16,584 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] [2024-11-20 04:41:16,638 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-20 04:41:16,785 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-20 04:41:16,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:41:16,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:41:16,786 INFO L85 PathProgramCache]: Analyzing trace with hash 807865276, now seen corresponding path program 1 times [2024-11-20 04:41:16,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:41:16,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705795321] [2024-11-20 04:41:16,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:41:16,788 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-20 04:41:16,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:41:16,791 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-20 04:41:16,792 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-20 04:41:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:41:18,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 04:41:18,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 04:41:18,374 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-20 04:41:18,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 04:41:18,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 04:41:18,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705795321] [2024-11-20 04:41:18,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705795321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 04:41:18,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 04:41:18,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 04:41:18,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114166273] [2024-11-20 04:41:18,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 04:41:18,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 04:41:18,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 04:41:18,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 04:41:18,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 04:41:18,379 INFO L87 Difference]: Start difference. First operand 157 states and 239 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (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-20 04:41:23,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-20 04:41:27,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-20 04:41:31,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-20 04:41:35,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-20 04:41:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 04:41:36,132 INFO L93 Difference]: Finished difference Result 465 states and 711 transitions. [2024-11-20 04:41:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 04:41:36,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (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 187 [2024-11-20 04:41:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 04:41:36,146 INFO L225 Difference]: With dead ends: 465 [2024-11-20 04:41:36,146 INFO L226 Difference]: Without dead ends: 311 [2024-11-20 04:41:36,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 04:41:36,153 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 121 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2024-11-20 04:41:36,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 407 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 17.6s Time] [2024-11-20 04:41:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-20 04:41:36,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 163. [2024-11-20 04:41:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 102 states have (on average 1.2745098039215685) internal successors, (130), 102 states have internal predecessors, (130), 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-20 04:41:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 246 transitions. [2024-11-20 04:41:36,214 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 246 transitions. Word has length 187 [2024-11-20 04:41:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 04:41:36,217 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 246 transitions. [2024-11-20 04:41:36,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (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-20 04:41:36,217 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 246 transitions. [2024-11-20 04:41:36,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-20 04:41:36,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 04:41:36,223 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] [2024-11-20 04:41:36,262 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-20 04:41:36,423 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-20 04:41:36,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 04:41:36,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 04:41:36,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1186279430, now seen corresponding path program 1 times [2024-11-20 04:41:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 04:41:36,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110680859] [2024-11-20 04:41:36,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 04:41:36,426 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-20 04:41:36,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 04:41:36,429 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-20 04:41:36,430 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-20 04:41:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 04:41:37,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 04:41:37,757 INFO L278 TraceCheckSpWp]: Computing forward predicates...