./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.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 e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:24:51,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:24:52,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:24:52,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:24:52,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:24:52,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:24:52,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:24:52,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:24:52,062 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:24:52,063 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:24:52,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:24:52,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:24:52,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:24:52,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:24:52,069 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:24:52,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:24:52,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:24:52,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:24:52,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:24:52,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:24:52,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:24:52,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:24:52,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:24:52,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:24:52,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:24:52,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:24:52,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:24:52,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:24:52,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:24:52,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:24:52,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:24:52,075 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:24:52,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:24:52,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:24:52,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:24:52,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:24:52,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:24:52,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:24:52,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:24:52,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:24:52,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:24:52,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:24:52,079 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 -> e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e [2024-11-12 02:24:52,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:24:52,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:24:52,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:24:52,406 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:24:52,407 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:24:52,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-12 02:24:53,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:24:54,063 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:24:54,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-12 02:24:54,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345404d42/c424924089684e40b57515e6badb1101/FLAG740569ec1 [2024-11-12 02:24:54,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/345404d42/c424924089684e40b57515e6badb1101 [2024-11-12 02:24:54,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:24:54,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:24:54,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:24:54,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:24:54,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:24:54,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@273aceaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54, skipping insertion in model container [2024-11-12 02:24:54,105 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:24:54,307 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_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-12 02:24:54,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:24:54,385 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:24:54,400 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_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-12 02:24:54,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:24:54,464 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:24:54,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54 WrapperNode [2024-11-12 02:24:54,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:24:54,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:24:54,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:24:54,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:24:54,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,544 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2024-11-12 02:24:54,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:24:54,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:24:54,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:24:54,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:24:54,563 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,590 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 02:24:54,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,609 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,623 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:24:54,624 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:24:54,624 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:24:54,624 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:24:54,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (1/1) ... [2024-11-12 02:24:54,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:24:54,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:24:54,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 02:24:54,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 02:24:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:24:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:24:54,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:24:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:24:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:24:54,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:24:54,852 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:24:54,856 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:24:55,288 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-12 02:24:55,288 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:24:55,309 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:24:55,309 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:24:55,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:24:55 BoogieIcfgContainer [2024-11-12 02:24:55,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:24:55,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:24:55,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:24:55,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:24:55,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:24:54" (1/3) ... [2024-11-12 02:24:55,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6ef30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:24:55, skipping insertion in model container [2024-11-12 02:24:55,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:24:54" (2/3) ... [2024-11-12 02:24:55,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f6ef30a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:24:55, skipping insertion in model container [2024-11-12 02:24:55,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:24:55" (3/3) ... [2024-11-12 02:24:55,321 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-12 02:24:55,337 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:24:55,337 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:24:55,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:24:55,399 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;@52dfeb7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:24:55,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:24:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:24:55,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 02:24:55,419 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:24:55,420 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:24:55,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:24:55,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:24:55,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1782693715, now seen corresponding path program 1 times [2024-11-12 02:24:55,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:24:55,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106436] [2024-11-12 02:24:55,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:24:55,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:24:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:24:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:24:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:24:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:24:55,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:24:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:24:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:24:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:24:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:24:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:24:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:24:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:24:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:24:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:24:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:24:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:24:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:24:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:24:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:24:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:24:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:24:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:24:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:24:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:24:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:24:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:24:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:24:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:24:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:24:55,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:24:55,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106436] [2024-11-12 02:24:55,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:24:55,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:24:55,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:24:55,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164540511] [2024-11-12 02:24:55,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:24:55,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:24:55,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:24:56,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:24:56,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:24:56,025 INFO L87 Difference]: Start difference. First operand has 109 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 02:24:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:24:56,070 INFO L93 Difference]: Finished difference Result 211 states and 358 transitions. [2024-11-12 02:24:56,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:24:56,072 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-12 02:24:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:24:56,083 INFO L225 Difference]: With dead ends: 211 [2024-11-12 02:24:56,083 INFO L226 Difference]: Without dead ends: 105 [2024-11-12 02:24:56,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:24:56,090 INFO L435 NwaCegarLoop]: 161 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, 161 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:24:56,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:24:56,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-12 02:24:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-12 02:24:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:24:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 161 transitions. [2024-11-12 02:24:56,138 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 161 transitions. Word has length 186 [2024-11-12 02:24:56,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:24:56,139 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 161 transitions. [2024-11-12 02:24:56,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 02:24:56,139 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 161 transitions. [2024-11-12 02:24:56,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-12 02:24:56,143 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:24:56,144 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:24:56,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:24:56,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:24:56,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:24:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 551637579, now seen corresponding path program 1 times [2024-11-12 02:24:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:24:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214845099] [2024-11-12 02:24:56,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:24:56,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:24:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:24:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:24:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:24:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:24:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:24:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:24:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:24:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:24:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:24:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:24:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:24:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:24:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:24:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:24:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:24:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:24:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:24:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:24:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:24:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:24:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:24:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:24:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:24:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:24:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:24:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:24:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:24:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:24:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:24:56,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:24:56,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:24:56,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214845099] [2024-11-12 02:24:56,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214845099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:24:56,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:24:56,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:24:56,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257298301] [2024-11-12 02:24:56,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:24:56,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:24:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:24:56,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:24:56,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:24:56,584 INFO L87 Difference]: Start difference. First operand 105 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:24:56,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:24:56,639 INFO L93 Difference]: Finished difference Result 208 states and 321 transitions. [2024-11-12 02:24:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:24:56,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-12 02:24:56,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:24:56,644 INFO L225 Difference]: With dead ends: 208 [2024-11-12 02:24:56,644 INFO L226 Difference]: Without dead ends: 106 [2024-11-12 02:24:56,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:24:56,649 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:24:56,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:24:56,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-12 02:24:56,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-12 02:24:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:24:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 162 transitions. [2024-11-12 02:24:56,695 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 162 transitions. Word has length 186 [2024-11-12 02:24:56,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:24:56,697 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 162 transitions. [2024-11-12 02:24:56,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:24:56,698 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 162 transitions. [2024-11-12 02:24:56,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-12 02:24:56,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:24:56,706 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:24:56,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:24:56,707 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:24:56,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:24:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash -16239608, now seen corresponding path program 1 times [2024-11-12 02:24:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:24:56,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087806204] [2024-11-12 02:24:56,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:24:56,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:24:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:25:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:25:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:25:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:25:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:25:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:25:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:25:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:25:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:25:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:25:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:25:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:25:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:25:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:25:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:25:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:25:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:25:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:25:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:25:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:25:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:25:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:25:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:25:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:25:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:25:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:25:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:25:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:25:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:25:00,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:00,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087806204] [2024-11-12 02:25:00,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087806204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:25:00,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:25:00,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 02:25:00,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289902773] [2024-11-12 02:25:00,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:25:00,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 02:25:00,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:00,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 02:25:00,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-12 02:25:00,695 INFO L87 Difference]: Start difference. First operand 106 states and 162 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 02:25:03,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:03,157 INFO L93 Difference]: Finished difference Result 323 states and 481 transitions. [2024-11-12 02:25:03,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 02:25:03,158 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 187 [2024-11-12 02:25:03,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:03,163 INFO L225 Difference]: With dead ends: 323 [2024-11-12 02:25:03,164 INFO L226 Difference]: Without dead ends: 220 [2024-11-12 02:25:03,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2024-11-12 02:25:03,167 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 706 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:03,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 511 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-12 02:25:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-12 02:25:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 136. [2024-11-12 02:25:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 105 states have (on average 1.4190476190476191) internal successors, (149), 105 states have internal predecessors, (149), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:25:03,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 205 transitions. [2024-11-12 02:25:03,189 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 205 transitions. Word has length 187 [2024-11-12 02:25:03,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:03,191 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 205 transitions. [2024-11-12 02:25:03,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 02:25:03,192 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 205 transitions. [2024-11-12 02:25:03,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-12 02:25:03,194 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:03,195 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:03,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:25:03,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:03,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1037307962, now seen corresponding path program 1 times [2024-11-12 02:25:03,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:03,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116843592] [2024-11-12 02:25:03,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:03,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:25:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:25:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:25:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:25:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:25:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:25:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:25:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:25:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:25:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:25:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:25:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:25:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:25:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:25:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:25:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:25:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:25:05,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:25:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:25:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:25:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:25:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:25:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:25:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:25:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:25:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:25:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:25:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:25:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:25:05,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:05,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116843592] [2024-11-12 02:25:05,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116843592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:25:05,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:25:05,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 02:25:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436400337] [2024-11-12 02:25:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:25:05,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 02:25:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 02:25:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 02:25:05,142 INFO L87 Difference]: Start difference. First operand 136 states and 205 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:05,522 INFO L93 Difference]: Finished difference Result 309 states and 464 transitions. [2024-11-12 02:25:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 02:25:05,523 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-12 02:25:05,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:05,528 INFO L225 Difference]: With dead ends: 309 [2024-11-12 02:25:05,528 INFO L226 Difference]: Without dead ends: 176 [2024-11-12 02:25:05,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 02:25:05,530 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 93 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:05,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 775 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 02:25:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-12 02:25:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 134. [2024-11-12 02:25:05,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:25:05,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 202 transitions. [2024-11-12 02:25:05,558 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 202 transitions. Word has length 187 [2024-11-12 02:25:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:05,560 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 202 transitions. [2024-11-12 02:25:05,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 202 transitions. [2024-11-12 02:25:05,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-12 02:25:05,563 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:05,563 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:05,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 02:25:05,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:05,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1705183350, now seen corresponding path program 1 times [2024-11-12 02:25:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:05,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615825494] [2024-11-12 02:25:05,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:05,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:08,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:25:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:08,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:25:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:08,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:25:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:08,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:25:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:25:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:25:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:25:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:25:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:25:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:25:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:25:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:25:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:25:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:25:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:25:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:25:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:25:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:25:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:25:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:25:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:25:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:25:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:25:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:25:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:25:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:25:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:25:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:25:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:25:09,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:09,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615825494] [2024-11-12 02:25:09,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615825494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:25:09,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:25:09,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 02:25:09,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495649668] [2024-11-12 02:25:09,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:25:09,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 02:25:09,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:09,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 02:25:09,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-12 02:25:09,090 INFO L87 Difference]: Start difference. First operand 134 states and 202 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 02:25:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:11,899 INFO L93 Difference]: Finished difference Result 377 states and 560 transitions. [2024-11-12 02:25:11,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 02:25:11,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 187 [2024-11-12 02:25:11,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:11,905 INFO L225 Difference]: With dead ends: 377 [2024-11-12 02:25:11,905 INFO L226 Difference]: Without dead ends: 246 [2024-11-12 02:25:11,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-12 02:25:11,907 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 450 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:11,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 512 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 02:25:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-12 02:25:11,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 141. [2024-11-12 02:25:11,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 110 states have (on average 1.4272727272727272) internal successors, (157), 110 states have internal predecessors, (157), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:25:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 213 transitions. [2024-11-12 02:25:11,933 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 213 transitions. Word has length 187 [2024-11-12 02:25:11,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:11,934 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 213 transitions. [2024-11-12 02:25:11,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 02:25:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 213 transitions. [2024-11-12 02:25:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-12 02:25:11,936 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:11,936 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:11,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 02:25:11,936 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:11,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1568715592, now seen corresponding path program 1 times [2024-11-12 02:25:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:11,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942091009] [2024-11-12 02:25:11,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:11,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:12,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:25:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:25:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:25:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:25:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:25:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:25:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:25:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:25:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:25:13,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:25:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:25:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:25:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:25:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:25:13,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:25:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:25:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:25:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:25:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:25:13,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:25:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:25:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:25:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:25:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:25:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:25:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:25:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:25:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:25:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:25:13,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:13,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942091009] [2024-11-12 02:25:13,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942091009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:25:13,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:25:13,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 02:25:13,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840790862] [2024-11-12 02:25:13,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:25:13,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 02:25:13,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:13,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 02:25:13,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 02:25:13,565 INFO L87 Difference]: Start difference. First operand 141 states and 213 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:14,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:14,133 INFO L93 Difference]: Finished difference Result 316 states and 474 transitions. [2024-11-12 02:25:14,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 02:25:14,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-12 02:25:14,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:14,135 INFO L225 Difference]: With dead ends: 316 [2024-11-12 02:25:14,135 INFO L226 Difference]: Without dead ends: 178 [2024-11-12 02:25:14,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 02:25:14,137 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 134 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:14,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 731 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 02:25:14,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-12 02:25:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 112. [2024-11-12 02:25:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:25:14,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2024-11-12 02:25:14,149 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 187 [2024-11-12 02:25:14,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:14,149 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2024-11-12 02:25:14,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:14,150 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2024-11-12 02:25:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 02:25:14,152 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:14,152 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:14,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 02:25:14,152 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:14,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:14,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1025154531, now seen corresponding path program 1 times [2024-11-12 02:25:14,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:14,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188563008] [2024-11-12 02:25:14,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:14,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:25:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:25:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:25:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:25:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:25:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:25:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:25:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:25:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:25:14,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:25:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:25:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:25:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:25:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:25:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:25:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:25:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:25:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:25:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:25:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:25:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:25:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:25:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:25:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:25:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:25:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:25:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:25:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:25:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 02:25:14,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188563008] [2024-11-12 02:25:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188563008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:25:14,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11922672] [2024-11-12 02:25:14,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:14,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:25:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:25:14,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 02:25:14,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 02:25:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:14,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 02:25:14,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:25:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 395 proven. 81 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-11-12 02:25:15,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:25:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 02:25:15,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11922672] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:25:15,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 02:25:15,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-12 02:25:15,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238701797] [2024-11-12 02:25:15,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 02:25:15,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 02:25:15,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:15,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 02:25:15,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-12 02:25:15,336 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 6 states have call successors, (82), 3 states have call predecessors, (82), 5 states have return successors, (83), 5 states have call predecessors, (83), 6 states have call successors, (83) [2024-11-12 02:25:15,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:15,621 INFO L93 Difference]: Finished difference Result 227 states and 336 transitions. [2024-11-12 02:25:15,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 02:25:15,622 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 6 states have call successors, (82), 3 states have call predecessors, (82), 5 states have return successors, (83), 5 states have call predecessors, (83), 6 states have call successors, (83) Word has length 189 [2024-11-12 02:25:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:15,624 INFO L225 Difference]: With dead ends: 227 [2024-11-12 02:25:15,624 INFO L226 Difference]: Without dead ends: 118 [2024-11-12 02:25:15,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-12 02:25:15,625 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 220 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:15,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 291 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:25:15,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-12 02:25:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2024-11-12 02:25:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:25:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2024-11-12 02:25:15,637 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 189 [2024-11-12 02:25:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:15,637 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2024-11-12 02:25:15,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.636363636363637) internal successors, (117), 11 states have internal predecessors, (117), 6 states have call successors, (82), 3 states have call predecessors, (82), 5 states have return successors, (83), 5 states have call predecessors, (83), 6 states have call successors, (83) [2024-11-12 02:25:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2024-11-12 02:25:15,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 02:25:15,640 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:15,640 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:15,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 02:25:15,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:25:15,841 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:15,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:15,841 INFO L85 PathProgramCache]: Analyzing trace with hash -968990175, now seen corresponding path program 1 times [2024-11-12 02:25:15,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:15,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835885890] [2024-11-12 02:25:15,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:15,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:25:15,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269261397] [2024-11-12 02:25:15,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:15,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:25:15,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:25:15,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 02:25:15,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 02:25:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:16,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 02:25:16,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:25:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-11-12 02:25:16,351 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:25:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 12 proven. 69 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-12 02:25:16,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:16,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835885890] [2024-11-12 02:25:16,699 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 02:25:16,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269261397] [2024-11-12 02:25:16,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269261397] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 02:25:16,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:25:16,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-12 02:25:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876840654] [2024-11-12 02:25:16,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:25:16,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 02:25:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:16,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 02:25:16,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-12 02:25:16,702 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 3 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 3 states have call predecessors, (52), 3 states have call successors, (52) [2024-11-12 02:25:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:17,568 INFO L93 Difference]: Finished difference Result 321 states and 448 transitions. [2024-11-12 02:25:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 02:25:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 3 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 3 states have call predecessors, (52), 3 states have call successors, (52) Word has length 189 [2024-11-12 02:25:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:17,571 INFO L225 Difference]: With dead ends: 321 [2024-11-12 02:25:17,571 INFO L226 Difference]: Without dead ends: 208 [2024-11-12 02:25:17,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-12 02:25:17,574 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 312 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:17,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 967 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 02:25:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-12 02:25:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 155. [2024-11-12 02:25:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 122 states have internal predecessors, (165), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:25:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 221 transitions. [2024-11-12 02:25:17,597 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 221 transitions. Word has length 189 [2024-11-12 02:25:17,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:17,598 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 221 transitions. [2024-11-12 02:25:17,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 3 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 3 states have call predecessors, (52), 3 states have call successors, (52) [2024-11-12 02:25:17,598 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 221 transitions. [2024-11-12 02:25:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 02:25:17,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:17,602 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:17,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 02:25:17,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-12 02:25:17,802 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:17,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:17,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1399968200, now seen corresponding path program 1 times [2024-11-12 02:25:17,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:17,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181980917] [2024-11-12 02:25:17,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:17,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:25:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:25:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:25:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:25:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:25:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:25:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:25:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:25:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:25:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:25:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:25:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:25:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:25:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:25:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:25:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:25:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:25:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:25:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:25:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:25:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:25:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:25:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:25:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:25:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:25:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:25:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:25:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:25:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:25:17,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:17,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181980917] [2024-11-12 02:25:17,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181980917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:25:17,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:25:17,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:25:17,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671410781] [2024-11-12 02:25:17,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:25:17,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:25:17,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:17,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:25:17,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:25:17,899 INFO L87 Difference]: Start difference. First operand 155 states and 221 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:18,054 INFO L93 Difference]: Finished difference Result 393 states and 562 transitions. [2024-11-12 02:25:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:25:18,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-12 02:25:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:18,057 INFO L225 Difference]: With dead ends: 393 [2024-11-12 02:25:18,059 INFO L226 Difference]: Without dead ends: 241 [2024-11-12 02:25:18,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:25:18,060 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 141 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:18,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 310 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:25:18,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-12 02:25:18,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 155. [2024-11-12 02:25:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 122 states have (on average 1.3442622950819672) internal successors, (164), 122 states have internal predecessors, (164), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:25:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 220 transitions. [2024-11-12 02:25:18,081 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 220 transitions. Word has length 189 [2024-11-12 02:25:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:18,082 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 220 transitions. [2024-11-12 02:25:18,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 220 transitions. [2024-11-12 02:25:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 02:25:18,085 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:18,085 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:18,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 02:25:18,086 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:18,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:18,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1098202920, now seen corresponding path program 1 times [2024-11-12 02:25:18,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:18,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445538500] [2024-11-12 02:25:18,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:18,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:25:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:25:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:25:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:25:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:25:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:25:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:25:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:25:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:25:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:25:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:25:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:25:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:25:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:25:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:25:18,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:25:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:25:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:25:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:25:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:25:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:25:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:25:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:25:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:25:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:25:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:25:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:25:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:25:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:18,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:25:18,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:18,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445538500] [2024-11-12 02:25:18,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445538500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:25:18,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:25:18,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 02:25:18,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110258329] [2024-11-12 02:25:18,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:25:18,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 02:25:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:18,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 02:25:18,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-12 02:25:18,897 INFO L87 Difference]: Start difference. First operand 155 states and 220 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:19,392 INFO L93 Difference]: Finished difference Result 549 states and 749 transitions. [2024-11-12 02:25:19,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 02:25:19,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-12 02:25:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:19,396 INFO L225 Difference]: With dead ends: 549 [2024-11-12 02:25:19,396 INFO L226 Difference]: Without dead ends: 397 [2024-11-12 02:25:19,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-12 02:25:19,397 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 191 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:19,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 729 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 02:25:19,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-12 02:25:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 274. [2024-11-12 02:25:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 226 states have (on average 1.3407079646017699) internal successors, (303), 227 states have internal predecessors, (303), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 02:25:19,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 381 transitions. [2024-11-12 02:25:19,428 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 381 transitions. Word has length 189 [2024-11-12 02:25:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:19,428 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 381 transitions. [2024-11-12 02:25:19,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 381 transitions. [2024-11-12 02:25:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 02:25:19,431 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:19,431 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:19,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 02:25:19,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:19,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:19,432 INFO L85 PathProgramCache]: Analyzing trace with hash -675501094, now seen corresponding path program 1 times [2024-11-12 02:25:19,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:19,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049728926] [2024-11-12 02:25:19,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:19,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:25:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:25:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:25:19,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:25:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:25:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:25:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:25:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:25:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:25:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:25:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:25:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:25:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:25:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:25:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:25:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:25:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:25:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:25:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:25:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:25:19,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:25:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:25:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:25:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:25:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:25:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:25:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:25:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:25:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:19,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:25:19,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:19,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049728926] [2024-11-12 02:25:19,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049728926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:25:19,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:25:19,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 02:25:19,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219603208] [2024-11-12 02:25:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:25:19,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 02:25:19,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:19,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 02:25:19,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:25:19,861 INFO L87 Difference]: Start difference. First operand 274 states and 381 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:20,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:20,357 INFO L93 Difference]: Finished difference Result 800 states and 1093 transitions. [2024-11-12 02:25:20,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 02:25:20,358 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-12 02:25:20,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:20,363 INFO L225 Difference]: With dead ends: 800 [2024-11-12 02:25:20,364 INFO L226 Difference]: Without dead ends: 529 [2024-11-12 02:25:20,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 02:25:20,366 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 171 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:20,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 908 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 02:25:20,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2024-11-12 02:25:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 281. [2024-11-12 02:25:20,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 233 states have (on average 1.3433476394849786) internal successors, (313), 234 states have internal predecessors, (313), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 02:25:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 391 transitions. [2024-11-12 02:25:20,398 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 391 transitions. Word has length 189 [2024-11-12 02:25:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:20,399 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 391 transitions. [2024-11-12 02:25:20,399 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 391 transitions. [2024-11-12 02:25:20,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 02:25:20,400 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:20,400 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:20,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 02:25:20,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:20,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash 29296591, now seen corresponding path program 1 times [2024-11-12 02:25:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692795290] [2024-11-12 02:25:20,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:20,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:25:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:25:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:25:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:25:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:25:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:25:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:25:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:25:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:25:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:25:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:25:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:25:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:25:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:25:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:25:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:25:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:25:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:25:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:25:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:25:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:25:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:25:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:25:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:25:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:25:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:25:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:25:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:25:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:25:22,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:22,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692795290] [2024-11-12 02:25:22,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692795290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:25:22,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:25:22,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 02:25:22,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053712927] [2024-11-12 02:25:22,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:25:22,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 02:25:22,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:22,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 02:25:22,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-12 02:25:22,660 INFO L87 Difference]: Start difference. First operand 281 states and 391 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:24,587 INFO L93 Difference]: Finished difference Result 794 states and 1093 transitions. [2024-11-12 02:25:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 02:25:24,588 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-12 02:25:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:24,591 INFO L225 Difference]: With dead ends: 794 [2024-11-12 02:25:24,591 INFO L226 Difference]: Without dead ends: 516 [2024-11-12 02:25:24,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-11-12 02:25:24,592 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 408 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:24,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1509 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-12 02:25:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-12 02:25:24,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 341. [2024-11-12 02:25:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 293 states have (on average 1.348122866894198) internal successors, (395), 294 states have internal predecessors, (395), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 02:25:24,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 473 transitions. [2024-11-12 02:25:24,623 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 473 transitions. Word has length 190 [2024-11-12 02:25:24,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:24,624 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 473 transitions. [2024-11-12 02:25:24,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:24,624 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 473 transitions. [2024-11-12 02:25:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 02:25:24,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:24,626 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 02:25:24,626 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:24,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:24,626 INFO L85 PathProgramCache]: Analyzing trace with hash 331061871, now seen corresponding path program 1 times [2024-11-12 02:25:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:24,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512000339] [2024-11-12 02:25:24,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:24,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:25:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:25:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:25:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:25:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:25:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:25:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:25:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:25:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:25:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:25:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:25:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:25:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:25:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:25:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:25:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:25:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:25:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:25:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:25:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:25:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:25:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:25:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:25:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:25:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:25:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:25:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:25:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:25:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:25:25,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512000339] [2024-11-12 02:25:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512000339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:25:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:25:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 02:25:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812883394] [2024-11-12 02:25:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:25:25,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 02:25:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:25,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 02:25:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 02:25:25,380 INFO L87 Difference]: Start difference. First operand 341 states and 473 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:26,341 INFO L93 Difference]: Finished difference Result 975 states and 1337 transitions. [2024-11-12 02:25:26,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 02:25:26,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-12 02:25:26,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:26,345 INFO L225 Difference]: With dead ends: 975 [2024-11-12 02:25:26,345 INFO L226 Difference]: Without dead ends: 637 [2024-11-12 02:25:26,347 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-12 02:25:26,347 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 357 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:26,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1341 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 02:25:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-12 02:25:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 347. [2024-11-12 02:25:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 299 states have (on average 1.3411371237458194) internal successors, (401), 300 states have internal predecessors, (401), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 02:25:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 479 transitions. [2024-11-12 02:25:26,388 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 479 transitions. Word has length 190 [2024-11-12 02:25:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:26,388 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 479 transitions. [2024-11-12 02:25:26,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 479 transitions. [2024-11-12 02:25:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 02:25:26,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:26,391 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:26,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 02:25:26,391 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:26,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash -144355016, now seen corresponding path program 1 times [2024-11-12 02:25:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:26,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357851145] [2024-11-12 02:25:26,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:25:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:25:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:25:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:25:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 02:25:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:25:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 02:25:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:25:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:25:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:25:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:25:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 02:25:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:25:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 02:25:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:25:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 02:25:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:25:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 02:25:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:25:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:25:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 02:25:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 02:25:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 02:25:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 02:25:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:25:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 02:25:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 02:25:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 02:25:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 02:25:26,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:25:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357851145] [2024-11-12 02:25:26,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357851145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:25:26,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:25:26,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 02:25:26,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396057138] [2024-11-12 02:25:26,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:25:26,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 02:25:26,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:25:26,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 02:25:26,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:25:26,803 INFO L87 Difference]: Start difference. First operand 347 states and 479 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:27,254 INFO L93 Difference]: Finished difference Result 839 states and 1133 transitions. [2024-11-12 02:25:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 02:25:27,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-12 02:25:27,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:27,258 INFO L225 Difference]: With dead ends: 839 [2024-11-12 02:25:27,258 INFO L226 Difference]: Without dead ends: 495 [2024-11-12 02:25:27,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-12 02:25:27,259 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 75 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:27,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 930 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 02:25:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-12 02:25:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 359. [2024-11-12 02:25:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 311 states have (on average 1.3408360128617363) internal successors, (417), 312 states have internal predecessors, (417), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 02:25:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 495 transitions. [2024-11-12 02:25:27,312 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 495 transitions. Word has length 190 [2024-11-12 02:25:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:27,313 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 495 transitions. [2024-11-12 02:25:27,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 02:25:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 495 transitions. [2024-11-12 02:25:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 02:25:27,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:27,315 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:27,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 02:25:27,316 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:27,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1264651464, now seen corresponding path program 1 times [2024-11-12 02:25:27,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:25:27,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166747032] [2024-11-12 02:25:27,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:27,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:25:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:25:27,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1216796233] [2024-11-12 02:25:27,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:27,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:25:27,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:25:27,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 02:25:27,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 02:25:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:25:27,579 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 02:25:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:25:27,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 02:25:27,745 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 02:25:27,746 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 02:25:27,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 02:25:27,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:25:27,951 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:28,088 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 02:25:28,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:25:28 BoogieIcfgContainer [2024-11-12 02:25:28,092 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 02:25:28,092 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 02:25:28,093 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 02:25:28,093 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 02:25:28,094 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:24:55" (3/4) ... [2024-11-12 02:25:28,096 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 02:25:28,097 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 02:25:28,098 INFO L158 Benchmark]: Toolchain (without parser) took 34003.36ms. Allocated memory was 153.1MB in the beginning and 408.9MB in the end (delta: 255.9MB). Free memory was 113.9MB in the beginning and 265.9MB in the end (delta: -151.9MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2024-11-12 02:25:28,098 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:25:28,098 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.67ms. Allocated memory is still 153.1MB. Free memory was 113.9MB in the beginning and 97.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 02:25:28,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.63ms. Allocated memory is still 153.1MB. Free memory was 97.5MB in the beginning and 93.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:25:28,099 INFO L158 Benchmark]: Boogie Preprocessor took 78.12ms. Allocated memory is still 153.1MB. Free memory was 93.8MB in the beginning and 90.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:25:28,100 INFO L158 Benchmark]: RCFGBuilder took 685.93ms. Allocated memory is still 153.1MB. Free memory was 90.0MB in the beginning and 99.3MB in the end (delta: -9.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 02:25:28,100 INFO L158 Benchmark]: TraceAbstraction took 32778.73ms. Allocated memory was 153.1MB in the beginning and 408.9MB in the end (delta: 255.9MB). Free memory was 98.8MB in the beginning and 265.9MB in the end (delta: -167.1MB). Peak memory consumption was 90.3MB. Max. memory is 16.1GB. [2024-11-12 02:25:28,100 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 408.9MB. Free memory is still 265.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:25:28,101 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.19ms. Allocated memory is still 153.1MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.67ms. Allocated memory is still 153.1MB. Free memory was 113.9MB in the beginning and 97.5MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.63ms. Allocated memory is still 153.1MB. Free memory was 97.5MB in the beginning and 93.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.12ms. Allocated memory is still 153.1MB. Free memory was 93.8MB in the beginning and 90.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 685.93ms. Allocated memory is still 153.1MB. Free memory was 90.0MB in the beginning and 99.3MB in the end (delta: -9.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 32778.73ms. Allocated memory was 153.1MB in the beginning and 408.9MB in the end (delta: 255.9MB). Free memory was 98.8MB in the beginning and 265.9MB in the end (delta: -167.1MB). Peak memory consumption was 90.3MB. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 408.9MB. Free memory is still 265.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 someBinaryDOUBLEComparisonOperation at line 170, overapproximation of shiftLeft at line 170, overapproximation of someUnaryDOUBLEoperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned long int var_1_22 = 0; [L40] unsigned char var_1_23 = 64; [L41] unsigned char var_1_24 = 2; [L42] double var_1_25 = 127.75; [L43] double var_1_26 = 9999999999999.2; [L44] double var_1_27 = 9.1; [L45] signed long int var_1_28 = -64; [L46] unsigned char var_1_29 = 8; [L47] unsigned char var_1_30 = 10; [L48] unsigned char var_1_31 = 0; [L49] unsigned char last_1_var_1_10 = 32; [L50] unsigned short int last_1_var_1_12 = 16; [L51] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L174] isInitial = 1 [L175] FCALL initially() [L176] COND TRUE 1 [L177] CALL updateLastVariables() [L165] last_1_var_1_10 = var_1_10 [L166] last_1_var_1_12 = var_1_12 [L167] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L120] var_1_3 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L121] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L122] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L122] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] var_1_5 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L124] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L125] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L125] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L127] var_1_6 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L128] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L129] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L129] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L130] var_1_7 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L131] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L132] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L132] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L133] var_1_8 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L134] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L135] var_1_9 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L136] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L137] var_1_11 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L138] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L139] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L139] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L140] var_1_15 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L141] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L142] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L142] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L143] var_1_20 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L144] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L145] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L146] var_1_21 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L147] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L148] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L148] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L149] var_1_22 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L150] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L151] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L151] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L153] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L154] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L154] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L155] var_1_27 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L156] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L157] var_1_30 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L158] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L159] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L160] var_1_31 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L161] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L162] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L178] RET updateVariables() [L179] CALL step() [L55] COND FALSE !(var_1_20 || var_1_21) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L58] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L59] COND TRUE var_1_23 > var_1_19 [L60] var_1_25 = ((((999999.5) < 0 ) ? -(999999.5) : (999999.5))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L62] COND FALSE !(var_1_22 < ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L67] var_1_28 = -256 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L68] COND TRUE var_1_28 != -32 [L69] var_1_29 = (var_1_30 + var_1_31) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L73] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L74] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L76] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L77] COND TRUE var_1_6 <= stepLocal_2 [L78] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L82] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L82] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L89] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L91] var_1_18 = var_1_3 [L92] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L93] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L94] COND FALSE !((- var_1_9) <= var_1_8) [L107] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L109] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L110] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L110] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L111] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L179] RET step() [L180] CALL, EXPR property() [L170] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170-L171] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.6s, OverallIterations: 15, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3264 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3258 mSDsluCounter, 9990 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7453 mSDsCounter, 266 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4745 IncrementalHoareTripleChecker+Invalid, 5011 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 266 mSolverCounterUnsat, 2537 mSDtfsCounter, 4745 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1674 GetRequests, 1540 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359occurred in iteration=14, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1410 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.4s InterpolantComputationTime, 3393 NumberOfCodeBlocks, 3393 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3185 ConstructedInterpolants, 0 QuantifiedInterpolants, 10957 SizeOfPredicates, 9 NumberOfNonLiveVariables, 878 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 25323/25704 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 02:25:28,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.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 e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:25:30,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:25:30,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 02:25:30,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:25:30,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:25:30,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:25:30,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:25:30,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:25:30,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:25:30,446 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:25:30,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:25:30,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:25:30,447 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:25:30,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:25:30,448 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:25:30,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:25:30,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:25:30,449 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:25:30,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:25:30,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:25:30,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:25:30,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:25:30,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:25:30,452 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 02:25:30,452 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 02:25:30,452 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:25:30,452 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 02:25:30,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:25:30,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:25:30,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:25:30,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:25:30,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:25:30,455 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:25:30,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:25:30,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:25:30,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:25:30,456 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:25:30,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:25:30,457 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 02:25:30,457 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 02:25:30,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:25:30,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:25:30,458 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:25:30,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:25:30,461 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 -> e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e [2024-11-12 02:25:30,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:25:30,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:25:30,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:25:30,840 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:25:30,841 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:25:30,842 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-12 02:25:32,404 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:25:32,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:25:32,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-12 02:25:32,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41829e1f6/4c7b099a0ca243449416b2f21ae06fc0/FLAGcf437909c [2024-11-12 02:25:32,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41829e1f6/4c7b099a0ca243449416b2f21ae06fc0 [2024-11-12 02:25:32,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:25:32,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:25:32,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:25:32,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:25:32,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:25:32,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:32" (1/1) ... [2024-11-12 02:25:32,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1be203ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:32, skipping insertion in model container [2024-11-12 02:25:32,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:32" (1/1) ... [2024-11-12 02:25:32,715 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:25:32,909 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_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-12 02:25:32,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:25:33,015 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:25:33,028 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_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-12 02:25:33,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:25:33,100 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:25:33,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33 WrapperNode [2024-11-12 02:25:33,101 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:25:33,102 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:25:33,102 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:25:33,102 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:25:33,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,124 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,159 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-12 02:25:33,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:25:33,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:25:33,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:25:33,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:25:33,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,211 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 02:25:33,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,256 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:25:33,257 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:25:33,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:25:33,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:25:33,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (1/1) ... [2024-11-12 02:25:33,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:25:33,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:25:33,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 02:25:33,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 02:25:33,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:25:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 02:25:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:25:33,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:25:33,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:25:33,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:25:33,429 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:25:33,432 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:25:33,944 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 02:25:33,945 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:25:33,959 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:25:33,959 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:25:33,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:33 BoogieIcfgContainer [2024-11-12 02:25:33,960 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:25:33,962 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:25:33,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:25:33,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:25:33,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:25:32" (1/3) ... [2024-11-12 02:25:33,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fa8a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:33, skipping insertion in model container [2024-11-12 02:25:33,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33" (2/3) ... [2024-11-12 02:25:33,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74fa8a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:33, skipping insertion in model container [2024-11-12 02:25:33,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:33" (3/3) ... [2024-11-12 02:25:33,969 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-12 02:25:33,985 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:25:33,986 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:25:34,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:25:34,062 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;@be8b75e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:25:34,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:25:34,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:25:34,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-12 02:25:34,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:34,082 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:34,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:34,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1692540324, now seen corresponding path program 1 times [2024-11-12 02:25:34,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:25:34,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688378981] [2024-11-12 02:25:34,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:34,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:25:34,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:25:34,108 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:25:34,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 02:25:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:34,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 02:25:34,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:25:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-12 02:25:34,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:25:34,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:25:34,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688378981] [2024-11-12 02:25:34,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688378981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:25:34,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:25:34,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:25:34,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329146698] [2024-11-12 02:25:34,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:25:34,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:25:34,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:25:34,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:25:34,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:25:34,452 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 02:25:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:34,485 INFO L93 Difference]: Finished difference Result 157 states and 276 transitions. [2024-11-12 02:25:34,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:25:34,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2024-11-12 02:25:34,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:34,496 INFO L225 Difference]: With dead ends: 157 [2024-11-12 02:25:34,496 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 02:25:34,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:25:34,503 INFO L435 NwaCegarLoop]: 119 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, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:34,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:25:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 02:25:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-12 02:25:34,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 02:25:34,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2024-11-12 02:25:34,547 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 178 [2024-11-12 02:25:34,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:34,547 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2024-11-12 02:25:34,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-12 02:25:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2024-11-12 02:25:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-12 02:25:34,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:34,551 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:34,560 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-12 02:25:34,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:25:34,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:34,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:34,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1469662952, now seen corresponding path program 1 times [2024-11-12 02:25:34,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:25:34,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608865925] [2024-11-12 02:25:34,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:34,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:25:34,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:25:34,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:25:34,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 02:25:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:35,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 02:25:35,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:25:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 501 proven. 126 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-11-12 02:25:37,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:25:38,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:25:38,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608865925] [2024-11-12 02:25:38,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608865925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:25:38,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1360310907] [2024-11-12 02:25:38,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:38,462 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 02:25:38,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 02:25:38,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 02:25:38,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-12 02:25:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:39,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 02:25:39,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:25:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 477 proven. 66 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-12 02:25:40,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:25:41,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1360310907] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:25:41,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:25:41,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 9 [2024-11-12 02:25:41,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627226763] [2024-11-12 02:25:41,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:25:41,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 02:25:41,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:25:41,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 02:25:41,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2024-11-12 02:25:41,103 INFO L87 Difference]: Start difference. First operand 78 states and 119 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2024-11-12 02:25:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:25:41,951 INFO L93 Difference]: Finished difference Result 239 states and 360 transitions. [2024-11-12 02:25:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 02:25:41,958 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) Word has length 179 [2024-11-12 02:25:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:25:41,961 INFO L225 Difference]: With dead ends: 239 [2024-11-12 02:25:41,962 INFO L226 Difference]: Without dead ends: 164 [2024-11-12 02:25:41,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=232, Invalid=418, Unknown=0, NotChecked=0, Total=650 [2024-11-12 02:25:41,964 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 76 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 02:25:41,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 550 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 02:25:41,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-12 02:25:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2024-11-12 02:25:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 02:25:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 214 transitions. [2024-11-12 02:25:42,004 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 214 transitions. Word has length 179 [2024-11-12 02:25:42,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:25:42,005 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 214 transitions. [2024-11-12 02:25:42,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 9 states have internal predecessors, (74), 3 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 3 states have call predecessors, (50), 3 states have call successors, (50) [2024-11-12 02:25:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 214 transitions. [2024-11-12 02:25:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-12 02:25:42,011 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:25:42,011 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:25:42,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-12 02:25:42,219 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-12 02:25:42,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:25:42,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:25:42,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:25:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2056468966, now seen corresponding path program 1 times [2024-11-12 02:25:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:25:42,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557189360] [2024-11-12 02:25:42,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:25:42,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:25:42,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:25:42,417 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:25:42,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 02:25:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:25:42,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 02:25:42,598 INFO L279 TraceCheckSpWp]: Computing forward predicates...